The DLV System for Knowledge Representation and Reasoning

The DLV System for Knowledge Representation and Reasoning

Veure altres versions (1)

Dades bibliogràfiques
Autors principals:	Leone, N, Pfeifer, G, Faber, W, Eiter, T, Gottlob, G, Perri, S, Scarcello, F
Format:	Journal article
Publicat:	2002

Ítems similars

The DLV system for knowledge representation and reasoning
per: Leone, N, et al.
Publicat: (2006)

The DLV System
per: Leone, N, et al.
Publicat: (2002)

The dlv System: Model Generator and Advanced Frontends (system description)
per: Citrigno, S, et al.
Publicat: (1997)

Measurement of the B̄ → Dlv̄ Partial width and form factor parameters
per: Athanas, M, et al.
Publicat: (1997)

Reasoning with parsimonious and moderately grounded expansions
per: Eiter, T, et al.
Publicat: (1992)

Reasoning under minimal upper bounds in propositional logic
per: Eiter, T, et al.
Publicat: (2006)

Reasoning under minimal upper bounds in propositional logic
per: Eiter, T, et al.
Publicat: (2006)

Fixed−parameter complexity in AI and nonmonotonic reasoning
per: Gottlob, G, et al.
Publicat: (2002)

Fixed−Parameter Complexity in AI and Nonmonotonic Reasoning
per: Gottlob, G, et al.
Publicat: (1999)

Bounded Treewidth as a Key to Tractability of Knowledge Representation and Reasoning
per: Gottlob, G, et al.
Publicat: (2006)

Bounded treewidth as a key to tractability of knowledge representation and reasoning
per: Gottlob, G, et al.
Publicat: (2010)

Propositional Circumscription and Extended Closed−World Reasoning are IIp2−Complete
per: Eiter, T, et al.
Publicat: (1993)

Boosting Information Integration: The INFOMIX System
per: Leone, N, et al.
Publicat: (2005)

Computing LOGCFL certificates
per: Gottlob, G, et al.
Publicat: (2002)

Hypertree Decompositions and Tractable Queries
per: Gottlob, G, et al.
Publicat: (2002)

Robbers‚ marshals‚ and guards: game theoretic and logical characterizations of hypertree width
per: Gottlob, G, et al.
Publicat: (2003)

On the Complexity of Some Inductive Logic Programming Problems
per: Gottlob, G, et al.
Publicat: (1997)

On the Complexity of Some Inductive Logic Programming Problems
per: Gottlob, G, et al.
Publicat: (1999)

The complexity of acyclic conjunctive queries
per: Gottlob, G, et al.
Publicat: (2001)

The Complexity of Acyclic Conjunctive Queries
per: Gottlob, G, et al.
Publicat: (1998)

Robbers‚ Marshals‚ and Guards: Game Theoretic and Logical Characterizations of Hypertree Width
per: Gottlob, G, et al.
Publicat: (2001)

Hypertree Decompositions and Tractable Queries
per: Gottlob, G, et al.
Publicat: (1998)

On Tractable Queries and Constraints
per: Gottlob, G, et al.
Publicat: (1999)

Hypertree Decompositions: A Survey
per: Gottlob, G, et al.
Publicat: (2001)

Hypertree Decompositions and Tractable Queries
per: Gottlob, G, et al.
Publicat: (1999)

A Comparison of Structural CSP Decomposition Methods
per: Gottlob, G, et al.
Publicat: (1999)

A comparison of structural CSP decomposition methods
per: Gottlob, G, et al.
Publicat: (2000)

Computing LOGCFL Certificates
per: Gottlob, G, et al.
Publicat: (1999)

Hypertree Decompositions and Tractable Queries
per: Gottlob, G, et al.
Publicat: (1999)

Robbers‚ Marshals‚ and Guards: Game Theoretic and Logical Characterizations of Hypertree Width
per: Gottlob, G, et al.
Publicat: (2001)

Complexity of Propositional Knowledge Base Revision
per: Eiter, T, et al.
Publicat: (1992)

On the Complexity of Propositional Knowledge Base Revision‚ Updates‚ and Counterfactuals
per: Eiter, T, et al.
Publicat: (1992)

On the Complexity of Propositional Knowledge Base Revision‚ Updates‚ and Counterfactuals
per: Eiter, T, et al.
Publicat: (1992)

The Complexity of Nested Counterfactuals and Iterated Knowledge Base Revisions
per: Eiter, T, et al.
Publicat: (1993)

The Complexity of Nested Counterfactuals and Iterated Knowledge Base Revisions
per: Eiter, T, et al.
Publicat: (1996)

Abduction from Logic Programs: Semantics and Complexity
per: Eiter, T, et al.
Publicat: (1997)

On the Indiscernibility of Individuals in Logic Programming
per: Eiter, T, et al.
Publicat: (1997)

Semantics and Complexity of Abduction from Default Theories
per: Eiter, T, et al.
Publicat: (1997)

Complexity Results for Abductive Logic Programming
per: Eiter, T, et al.
Publicat: (1995)

Semantics and Complexity of Abduction from Default Theories
per: Eiter, T, et al.
Publicat: (1995)