On the Computational Cost of Disjunctive Logic Programming: Propositional Case

On the Computational Cost of Disjunctive Logic Programming: Propositional Case

Detalles Bibliográficos
Main Authors:	Eiter, T, Gottlob, G
Formato:	Journal article
Publicado:	1995

Títulos similares

Complexity Results for Disjunctive Logic Programming and Application to Nonmonotonic Logics
por: Eiter, T, et al.
Publicado: (1993)

Disjunctive Logic Programming over Finite Structures
por: Eiter, T, et al.
Publicado: (1994)

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

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

Complexity and Expressive Power of Disjunctive Logic Programming
por: Gottlob, G
Publicado: (1994)

Causal Models of Disjunctive Logic Programs
por: Dix, J, et al.
Publicado: (1994)

Disjunctive Datalog
por: Eiter, T, et al.
Publicado: (1997)

Adding Disjunction to Datalog
por: Eiter, T, et al.
Publicado: (1994)

Complexity Aspects of Various Semantics for Disjunctive Databases
por: Eiter, T, et al.
Publicado: (1993)

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

Expressive Power and Complexity of Disjunctive Datalog under the Stable Model Semantics
por: Eiter, T, et al.
Publicado: (1994)

Curb Your Theory! A Circumspective Approach for Inclusive Interpretation of Disjunctive Information
por: Eiter, T, et al.
Publicado: (1993)

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

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

Hypergraph Transversal Computation and Related Problems in Logic and AI
por: Eiter, T, et al.
Publicado: (2002)

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

Generalized Quantifiers in Logic Programs
por: Eiter, T, et al.
Publicado: (1997)

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

Propositional default logics made easier: computational complexity of model checking
por: Baumgartner, R, et al.
Publicado: (2002)

Expressiveness of Stable Model Semantics for Disjuncitve Logic Programs with Functions
por: Eiter, T, et al.
Publicado: (1997)

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

Modular Logic Programming and Generalized Quantifiers
por: Eiter, T, et al.
Publicado: (1997)

Complexity of propositional nested circumscription and nested abnormality theories
por: Cadoli, M, et al.
Publicado: (2005)

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

Computing datalog rewritings for disjunctive datalog programs and description logic ontologies
por: Kaminski, M, et al.
Publicado: (2014)

Complexity and expressive power of logic programming
por: Dantsin, E, et al.
Publicado: (2001)

Complexity and Expressive Power of Logic Programming
por: Dantsin, E, et al.
Publicado: (1997)

On the Complexity of Model Checking for Propositional Default Logics: New Results and Tractable Cases
por: Baumgartner, R, et al.
Publicado: (1999)

The Complexity of Logic−Based Abduction
por: Eiter, T, et al.
Publicado: (1995)

The Complexity of Logic−Based Abduction
por: Eiter, T, et al.
Publicado: (1993)

Many−Valued Disjunctive Logic Programs with Probabilistic Semantics
por: Lukasiewicz, T
Publicado: (1999)

Complexity Results for Logic−Based Abduction
por: Eiter, T, et al.
Publicado: (1992)

On the Expressiveness of Frame Satisfiability and Fragments of Second−Order Logic
por: Eiter, T, et al.
Publicado: (1998)

The Complexity Class Theta2p: Recent Results and Applications in AI and Modal Logic
por: Eiter, T, et al.
Publicado: (1997)

Default Logic as a Query Language
por: Cadoli, M, et al.
Publicado: (1997)

Default Logic as a Query Language
por: Cadoli, M, et al.
Publicado: (1994)

An alternative rule of disjunction in modal logic
por: Williamson, T
Publicado: (1992)

Mental Logic and the Denials of Conjunctions and Disjunctions
por: Miguel López-Astorga
Publicado: (2016-03-01)

Mental logic and its difficulties with disjunction
por: Miguel López-Astorga
Publicado: (2016-05-01)

Fixpoint Characterizations for Many−Valued Disjunctive Logic Programs with Probabilistic Semantics
por: Lukasiewicz, T
Publicado: (2001)