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

Bibliografski detalji
Glavni autori:	Eiter, T, Gottlob, G
Format:	Conference item
Izdano:	Springer 1997

Slični predmeti

Complexity Results for Disjunctive Logic Programming and Application to Nonmonotonic Logics
od: Eiter, T, i dr.
Izdano: (1993)

Complexity Results for Logic−Based Abduction
od: Eiter, T, i dr.
Izdano: (1992)

Complexity Results for Abductive Logic Programming
od: Eiter, T, i dr.
Izdano: (1995)

Hypergraph Transversal Computation and Related Problems in Logic and AI
od: Eiter, T, i dr.
Izdano: (2002)

The Complexity of Logic−Based Abduction
od: Eiter, T, i dr.
Izdano: (1995)

The Complexity of Logic−Based Abduction
od: Eiter, T, i dr.
Izdano: (1993)

Abduction from Logic Programs: Semantics and Complexity
od: Eiter, T, i dr.
Izdano: (1997)

Complexity and Expressive Power of Logic Programming
od: Dantsin, E, i dr.
Izdano: (1997)

Complexity and expressive power of logic programming
od: Dantsin, E, i dr.
Izdano: (2001)

Complexity Results for Nonmonotonic Logics
od: Gottlob, G
Izdano: (1992)

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

From Carnap's Modal Logic to Autoepistemic Logic
od: Gottlob, G
Izdano: (1994)

Reasoning under minimal upper bounds in propositional logic
od: Eiter, T, i dr.
Izdano: (2006)

On the Computational Cost of Disjunctive Logic Programming: Propositional Case
od: Eiter, T, i dr.
Izdano: (1995)

On the Expressiveness of Frame Satisfiability and Fragments of Second−Order Logic
od: Eiter, T, i dr.
Izdano: (1998)

Reasoning under minimal upper bounds in propositional logic
od: Eiter, T, i dr.
Izdano: (2006)

Expressiveness of Stable Model Semantics for Disjuncitve Logic Programs with Functions
od: Eiter, T, i dr.
Izdano: (1997)

On the Indiscernibility of Individuals in Logic Programming
od: Eiter, T, i dr.
Izdano: (1997)

Generalized Quantifiers in Logic Programs
od: Eiter, T, i dr.
Izdano: (1997)

Default Logic as a Query Language
od: Cadoli, M, i dr.
Izdano: (1997)

Modular Logic Programming and Generalized Quantifiers
od: Eiter, T, i dr.
Izdano: (1997)

Default Logic as a Query Language
od: Cadoli, M, i dr.
Izdano: (1994)

NP Trees and Carnap's Modal Logic
od: Gottlob, G
Izdano: (1993)

NP Trees and Carnap's Modal Logic
od: Gottlob, G
Izdano: (1995)

Existential second−order logic over strings
od: Eiter, T, i dr.
Izdano: (2000)

Existential Second−Order Logic over Strings
od: Eiter, T, i dr.
Izdano: (1998)

Disjunctive Logic Programming over Finite Structures
od: Eiter, T, i dr.
Izdano: (1994)

Second−Order Logic over Strings: Regular and Non−regular Fragments
od: Eiter, T, i dr.
Izdano: (2001)

On the Complexity of Theory Curbing
od: Eiter, T, i dr.
Izdano: (2000)

Asymptotic Conditional Probability in Modal Logic: A Probabilistic Reconstruction of Nonmonotonic Logic
od: Rosati, R, i dr.
Izdano: (2005)

Complexity of Propositional Knowledge Base Revision
od: Eiter, T, i dr.
Izdano: (1992)

Normal Forms for Second−Order Logic over Finite Structures‚ and Classification of NP Optimization Problems
od: Eiter, T, i dr.
Izdano: (1996)

Enhancing Model Checking in Verification by AI Techniques
od: Buccafurri, F, i dr.
Izdano: (1999)

Complexity Aspects of Various Semantics for Disjunctive Databases
od: Eiter, T, i dr.
Izdano: (1993)

On the Complexity of Propositional Knowledge Base Revision‚ Updates‚ and Counterfactuals
od: Eiter, T, i dr.
Izdano: (1992)

On the Complexity of Propositional Knowledge Base Revision‚ Updates‚ and Counterfactuals
od: Eiter, T, i dr.
Izdano: (1992)

The Complexity of Nested Counterfactuals and Iterated Knowledge Base Revisions
od: Eiter, T, i dr.
Izdano: (1993)

The Complexity of Nested Counterfactuals and Iterated Knowledge Base Revisions
od: Eiter, T, i dr.
Izdano: (1996)

Complexity results for modal logic with recursion via translations and tableaux
od: Luca Aceto, i dr.
Izdano: (2024-08-01)

On the Complexity of Model Checking for Propositional Default Logics: New Results and Tractable Cases
od: Baumgartner, R, i dr.
Izdano: (1999)