On the Computational Cost of Disjunctive Logic Programming: Propositional Case

On the Computational Cost of Disjunctive Logic Programming: Propositional Case

Sonraí bibleagrafaíochta
Príomhchruthaitheoirí:	Eiter, T, Gottlob, G
Formáid:	Journal article
Foilsithe / Cruthaithe:	1995

Míreanna comhchosúla

Complexity Results for Disjunctive Logic Programming and Application to Nonmonotonic Logics
de réir: Eiter, T, et al.
Foilsithe / Cruthaithe: (1993)

Disjunctive Logic Programming over Finite Structures
de réir: Eiter, T, et al.
Foilsithe / Cruthaithe: (1994)

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)

Complexity and Expressive Power of Disjunctive Logic Programming
de réir: Gottlob, G
Foilsithe / Cruthaithe: (1994)

Causal Models of Disjunctive Logic Programs
de réir: Dix, J, et al.
Foilsithe / Cruthaithe: (1994)

Disjunctive Datalog
de réir: Eiter, T, et al.
Foilsithe / Cruthaithe: (1997)

Adding Disjunction to Datalog
de réir: Eiter, T, et al.
Foilsithe / Cruthaithe: (1994)

Complexity Aspects of Various Semantics for Disjunctive Databases
de réir: Eiter, T, et al.
Foilsithe / Cruthaithe: (1993)

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

Expressive Power and Complexity of Disjunctive Datalog under the Stable Model Semantics
de réir: Eiter, T, et al.
Foilsithe / Cruthaithe: (1994)

Curb Your Theory! A Circumspective Approach for Inclusive Interpretation of Disjunctive Information
de réir: Eiter, T, et al.
Foilsithe / Cruthaithe: (1993)

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)

Hypergraph Transversal Computation and Related Problems in Logic and AI
de réir: Eiter, T, et al.
Foilsithe / Cruthaithe: (2002)

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

Generalized Quantifiers in Logic Programs
de réir: Eiter, T, et al.
Foilsithe / Cruthaithe: (1997)

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

Propositional default logics made easier: computational complexity of model checking
de réir: Baumgartner, R, et al.
Foilsithe / Cruthaithe: (2002)

Expressiveness of Stable Model Semantics for Disjuncitve Logic Programs with Functions
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)

Modular Logic Programming and Generalized Quantifiers
de réir: Eiter, T, et al.
Foilsithe / Cruthaithe: (1997)

Complexity of propositional nested circumscription and nested abnormality theories
de réir: Cadoli, M, et al.
Foilsithe / Cruthaithe: (2005)

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

Computing datalog rewritings for disjunctive datalog programs and description logic ontologies
de réir: Kaminski, M, et al.
Foilsithe / Cruthaithe: (2014)

Complexity and expressive power of logic programming
de réir: Dantsin, E, et al.
Foilsithe / Cruthaithe: (2001)

Complexity and Expressive Power of Logic Programming
de réir: Dantsin, E, et al.
Foilsithe / Cruthaithe: (1997)

On the Complexity of Model Checking for Propositional Default Logics: New Results and Tractable Cases
de réir: Baumgartner, R, et al.
Foilsithe / Cruthaithe: (1999)

The Complexity of Logic−Based Abduction
de réir: Eiter, T, et al.
Foilsithe / Cruthaithe: (1995)

The Complexity of Logic−Based Abduction
de réir: Eiter, T, et al.
Foilsithe / Cruthaithe: (1993)

Many−Valued Disjunctive Logic Programs with Probabilistic Semantics
de réir: Lukasiewicz, T
Foilsithe / Cruthaithe: (1999)

Complexity Results for Logic−Based Abduction
de réir: Eiter, T, et al.
Foilsithe / Cruthaithe: (1992)

On the Expressiveness of Frame Satisfiability and Fragments of Second−Order Logic
de réir: Eiter, T, et al.
Foilsithe / Cruthaithe: (1998)

The Complexity Class Theta2p: Recent Results and Applications in AI and Modal Logic
de réir: Eiter, T, et al.
Foilsithe / Cruthaithe: (1997)

Default Logic as a Query Language
de réir: Cadoli, M, et al.
Foilsithe / Cruthaithe: (1997)

Default Logic as a Query Language
de réir: Cadoli, M, et al.
Foilsithe / Cruthaithe: (1994)

An alternative rule of disjunction in modal logic
de réir: Williamson, T
Foilsithe / Cruthaithe: (1992)

Mental Logic and the Denials of Conjunctions and Disjunctions
de réir: Miguel López-Astorga
Foilsithe / Cruthaithe: (2016-03-01)

Mental logic and its difficulties with disjunction
de réir: Miguel López-Astorga
Foilsithe / Cruthaithe: (2016-05-01)

Fixpoint Characterizations for Many−Valued Disjunctive Logic Programs with Probabilistic Semantics
de réir: Lukasiewicz, T
Foilsithe / Cruthaithe: (2001)