The DLV System for Knowledge Representation and Reasoning

The DLV System for Knowledge Representation and Reasoning

Показать другие версии (1)

Библиографические подробности
Главные авторы:	Leone, N, Pfeifer, G, Faber, W, Eiter, T, Gottlob, G, Perri, S, Scarcello, F
Формат:	Journal article
Опубликовано:	2002

Схожие документы

The DLV system for knowledge representation and reasoning
по: Leone, N, и др.
Опубликовано: (2006)

The DLV System
по: Leone, N, и др.
Опубликовано: (2002)

The dlv System: Model Generator and Advanced Frontends (system description)
по: Citrigno, S, и др.
Опубликовано: (1997)

Measurement of the B̄ → Dlv̄ Partial width and form factor parameters
по: Athanas, M, и др.
Опубликовано: (1997)

Reasoning with parsimonious and moderately grounded expansions
по: Eiter, T, и др.
Опубликовано: (1992)

Reasoning under minimal upper bounds in propositional logic
по: Eiter, T, и др.
Опубликовано: (2006)

Reasoning under minimal upper bounds in propositional logic
по: Eiter, T, и др.
Опубликовано: (2006)

Fixed−parameter complexity in AI and nonmonotonic reasoning
по: Gottlob, G, и др.
Опубликовано: (2002)

Fixed−Parameter Complexity in AI and Nonmonotonic Reasoning
по: Gottlob, G, и др.
Опубликовано: (1999)

Propositional Circumscription and Extended Closed−World Reasoning are IIp2−Complete
по: Eiter, T, и др.
Опубликовано: (1993)

Bounded Treewidth as a Key to Tractability of Knowledge Representation and Reasoning
по: Gottlob, G, и др.
Опубликовано: (2006)

Bounded treewidth as a key to tractability of knowledge representation and reasoning
по: Gottlob, G, и др.
Опубликовано: (2010)

Boosting Information Integration: The INFOMIX System
по: Leone, N, и др.
Опубликовано: (2005)

Complexity of Propositional Knowledge Base Revision
по: Eiter, T, и др.
Опубликовано: (1992)

Computing LOGCFL certificates
по: Gottlob, G, и др.
Опубликовано: (2002)

Hypertree Decompositions and Tractable Queries
по: Gottlob, G, и др.
Опубликовано: (2002)

Robbers‚ marshals‚ and guards: game theoretic and logical characterizations of hypertree width
по: Gottlob, G, и др.
Опубликовано: (2003)

On the Complexity of Some Inductive Logic Programming Problems
по: Gottlob, G, и др.
Опубликовано: (1997)

On the Complexity of Some Inductive Logic Programming Problems
по: Gottlob, G, и др.
Опубликовано: (1999)

The complexity of acyclic conjunctive queries
по: Gottlob, G, и др.
Опубликовано: (2001)

The Complexity of Acyclic Conjunctive Queries
по: Gottlob, G, и др.
Опубликовано: (1998)

Robbers‚ Marshals‚ and Guards: Game Theoretic and Logical Characterizations of Hypertree Width
по: Gottlob, G, и др.
Опубликовано: (2001)

Hypertree Decompositions and Tractable Queries
по: Gottlob, G, и др.
Опубликовано: (1998)

On Tractable Queries and Constraints
по: Gottlob, G, и др.
Опубликовано: (1999)

Hypertree Decompositions: A Survey
по: Gottlob, G, и др.
Опубликовано: (2001)

Hypertree Decompositions and Tractable Queries
по: Gottlob, G, и др.
Опубликовано: (1999)

A Comparison of Structural CSP Decomposition Methods
по: Gottlob, G, и др.
Опубликовано: (1999)

A comparison of structural CSP decomposition methods
по: Gottlob, G, и др.
Опубликовано: (2000)

Computing LOGCFL Certificates
по: Gottlob, G, и др.
Опубликовано: (1999)

Hypertree Decompositions and Tractable Queries
по: Gottlob, G, и др.
Опубликовано: (1999)

Robbers‚ Marshals‚ and Guards: Game Theoretic and Logical Characterizations of Hypertree Width
по: Gottlob, G, и др.
Опубликовано: (2001)

On the Complexity of Propositional Knowledge Base Revision‚ Updates‚ and Counterfactuals
по: Eiter, T, и др.
Опубликовано: (1992)

On the Complexity of Propositional Knowledge Base Revision‚ Updates‚ and Counterfactuals
по: Eiter, T, и др.
Опубликовано: (1992)

The Complexity of Nested Counterfactuals and Iterated Knowledge Base Revisions
по: Eiter, T, и др.
Опубликовано: (1993)

The Complexity of Nested Counterfactuals and Iterated Knowledge Base Revisions
по: Eiter, T, и др.
Опубликовано: (1996)

Abduction from Logic Programs: Semantics and Complexity
по: Eiter, T, и др.
Опубликовано: (1997)

On the Indiscernibility of Individuals in Logic Programming
по: Eiter, T, и др.
Опубликовано: (1997)

Semantics and Complexity of Abduction from Default Theories
по: Eiter, T, и др.
Опубликовано: (1997)

Complexity Results for Abductive Logic Programming
по: Eiter, T, и др.
Опубликовано: (1995)

Semantics and Complexity of Abduction from Default Theories
по: Eiter, T, и др.
Опубликовано: (1995)