The DLV System for Knowledge Representation and Reasoning

The DLV System for Knowledge Representation and Reasoning

Taispeáin leaganacha eile (1)

Sonraí bibleagrafaíochta
Príomhchruthaitheoirí:	Leone, N, Pfeifer, G, Faber, W, Eiter, T, Gottlob, G, Perri, S, Scarcello, F
Formáid:	Journal article
Foilsithe / Cruthaithe:	2002

Míreanna comhchosúla

The DLV system for knowledge representation and reasoning
de réir: Leone, N, et al.
Foilsithe / Cruthaithe: (2006)

The DLV System
de réir: Leone, N, et al.
Foilsithe / Cruthaithe: (2002)

The dlv System: Model Generator and Advanced Frontends (system description)
de réir: Citrigno, S, et al.
Foilsithe / Cruthaithe: (1997)

Measurement of the B̄ → Dlv̄ Partial width and form factor parameters
de réir: Athanas, M, et al.
Foilsithe / Cruthaithe: (1997)

Reasoning with parsimonious and moderately grounded expansions
de réir: Eiter, T, et al.
Foilsithe / Cruthaithe: (1992)

Reasoning under minimal upper bounds in propositional logic
de réir: Eiter, T, et al.
Foilsithe / Cruthaithe: (2006)

Reasoning under minimal upper bounds in propositional logic
de réir: Eiter, T, et al.
Foilsithe / Cruthaithe: (2006)

Fixed−parameter complexity in AI and nonmonotonic reasoning
de réir: Gottlob, G, et al.
Foilsithe / Cruthaithe: (2002)

Fixed−Parameter Complexity in AI and Nonmonotonic Reasoning
de réir: Gottlob, G, et al.
Foilsithe / Cruthaithe: (1999)

Bounded Treewidth as a Key to Tractability of Knowledge Representation and Reasoning
de réir: Gottlob, G, et al.
Foilsithe / Cruthaithe: (2006)

Bounded treewidth as a key to tractability of knowledge representation and reasoning
de réir: Gottlob, G, et al.
Foilsithe / Cruthaithe: (2010)

Propositional Circumscription and Extended Closed−World Reasoning are IIp2−Complete
de réir: Eiter, T, et al.
Foilsithe / Cruthaithe: (1993)

Boosting Information Integration: The INFOMIX System
de réir: Leone, N, et al.
Foilsithe / Cruthaithe: (2005)

Complexity of Propositional Knowledge Base Revision
de réir: Eiter, T, et al.
Foilsithe / Cruthaithe: (1992)

Computing LOGCFL certificates
de réir: Gottlob, G, et al.
Foilsithe / Cruthaithe: (2002)

Hypertree Decompositions and Tractable Queries
de réir: Gottlob, G, et al.
Foilsithe / Cruthaithe: (2002)

Robbers‚ marshals‚ and guards: game theoretic and logical characterizations of hypertree width
de réir: Gottlob, G, et al.
Foilsithe / Cruthaithe: (2003)

On the Complexity of Some Inductive Logic Programming Problems
de réir: Gottlob, G, et al.
Foilsithe / Cruthaithe: (1997)

On the Complexity of Some Inductive Logic Programming Problems
de réir: Gottlob, G, et al.
Foilsithe / Cruthaithe: (1999)

The complexity of acyclic conjunctive queries
de réir: Gottlob, G, et al.
Foilsithe / Cruthaithe: (2001)

The Complexity of Acyclic Conjunctive Queries
de réir: Gottlob, G, et al.
Foilsithe / Cruthaithe: (1998)

Robbers‚ Marshals‚ and Guards: Game Theoretic and Logical Characterizations of Hypertree Width
de réir: Gottlob, G, et al.
Foilsithe / Cruthaithe: (2001)

Hypertree Decompositions and Tractable Queries
de réir: Gottlob, G, et al.
Foilsithe / Cruthaithe: (1998)

On Tractable Queries and Constraints
de réir: Gottlob, G, et al.
Foilsithe / Cruthaithe: (1999)

Hypertree Decompositions: A Survey
de réir: Gottlob, G, et al.
Foilsithe / Cruthaithe: (2001)

Hypertree Decompositions and Tractable Queries
de réir: Gottlob, G, et al.
Foilsithe / Cruthaithe: (1999)

A Comparison of Structural CSP Decomposition Methods
de réir: Gottlob, G, et al.
Foilsithe / Cruthaithe: (1999)

A comparison of structural CSP decomposition methods
de réir: Gottlob, G, et al.
Foilsithe / Cruthaithe: (2000)

Computing LOGCFL Certificates
de réir: Gottlob, G, et al.
Foilsithe / Cruthaithe: (1999)

Hypertree Decompositions and Tractable Queries
de réir: Gottlob, G, et al.
Foilsithe / Cruthaithe: (1999)

Robbers‚ Marshals‚ and Guards: Game Theoretic and Logical Characterizations of Hypertree Width
de réir: Gottlob, G, et al.
Foilsithe / Cruthaithe: (2001)

On the Complexity of Propositional Knowledge Base Revision‚ Updates‚ and Counterfactuals
de réir: Eiter, T, et al.
Foilsithe / Cruthaithe: (1992)

On the Complexity of Propositional Knowledge Base Revision‚ Updates‚ and Counterfactuals
de réir: Eiter, T, et al.
Foilsithe / Cruthaithe: (1992)

The Complexity of Nested Counterfactuals and Iterated Knowledge Base Revisions
de réir: Eiter, T, et al.
Foilsithe / Cruthaithe: (1993)

The Complexity of Nested Counterfactuals and Iterated Knowledge Base Revisions
de réir: Eiter, T, et al.
Foilsithe / Cruthaithe: (1996)

Abduction from Logic Programs: Semantics and Complexity
de réir: Eiter, T, et al.
Foilsithe / Cruthaithe: (1997)

On the Indiscernibility of Individuals in Logic Programming
de réir: Eiter, T, et al.
Foilsithe / Cruthaithe: (1997)

Semantics and Complexity of Abduction from Default Theories
de réir: Eiter, T, et al.
Foilsithe / Cruthaithe: (1997)

Complexity Results for Abductive Logic Programming
de réir: Eiter, T, et al.
Foilsithe / Cruthaithe: (1995)

Semantics and Complexity of Abduction from Default Theories
de réir: Eiter, T, et al.
Foilsithe / Cruthaithe: (1995)