The Complexity Class Theta2p: Recent Results and Applications in AI and Modal Logic

The Complexity Class Theta2p: Recent Results and Applications in AI and Modal Logic

Dades bibliogràfiques
Autors principals:	Eiter, T, Gottlob, G
Format:	Conference item
Publicat:	Springer 1997

Ítems similars

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

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

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

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

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

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

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

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

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

Complexity Results for Nonmonotonic Logics
per: Gottlob, G
Publicat: (1992)

Recent Complexity Results in Logic Programming and Nonmonotonic Reasoning‚ and Why They Matter (Invited Talk Abstract)
per: Gottlob, G
Publicat: (1993)

From Carnap's Modal Logic to Autoepistemic Logic
per: Gottlob, G
Publicat: (1994)

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

On the Computational Cost of Disjunctive Logic Programming: Propositional Case
per: Eiter, T, et al.
Publicat: (1995)

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

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

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

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

Generalized Quantifiers in Logic Programs
per: Eiter, T, et al.
Publicat: (1997)

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

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

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

NP Trees and Carnap's Modal Logic
per: Gottlob, G
Publicat: (1993)

NP Trees and Carnap's Modal Logic
per: Gottlob, G
Publicat: (1995)

Existential second−order logic over strings
per: Eiter, T, et al.
Publicat: (2000)

Existential Second−Order Logic over Strings
per: Eiter, T, et al.
Publicat: (1998)

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

Second−Order Logic over Strings: Regular and Non−regular Fragments
per: Eiter, T, et al.
Publicat: (2001)

On the Complexity of Theory Curbing
per: Eiter, T, et al.
Publicat: (2000)

Asymptotic Conditional Probability in Modal Logic: A Probabilistic Reconstruction of Nonmonotonic Logic
per: Rosati, R, et al.
Publicat: (2005)

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

Normal Forms for Second−Order Logic over Finite Structures‚ and Classification of NP Optimization Problems
per: Eiter, T, et al.
Publicat: (1996)

Enhancing Model Checking in Verification by AI Techniques
per: Buccafurri, F, et al.
Publicat: (1999)

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

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)

Complexity results for modal logic with recursion via translations and tableaux
per: Luca Aceto, et al.
Publicat: (2024-08-01)

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