Complexity Results for Logic−Based Abduction

Complexity Results for Logic−Based Abduction

Detalhes bibliográficos
Main Authors:	Eiter, T, Gottlob, G
Formato:	Conference item
Publicado em:	1992

Registos relacionados

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

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

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

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

Semantics and Complexity of Abduction from Default Theories
Por: Eiter, T, et al.
Publicado em: (1997)

Semantics and Complexity of Abduction from Default Theories
Por: Eiter, T, et al.
Publicado em: (1995)

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

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

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

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

Complexity Results for Nonmonotonic Logics
Por: Gottlob, G
Publicado em: (1992)

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

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

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

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

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

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

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

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

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

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

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

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

Abduction at the interface of Logic and Philosophy of Science
Por: Johan Van Benthem
Publicado em: (2009-12-01)

Hypothesis Classification‚ Abductive Diagnosis and Therapy
Por: Friedrich, G, et al.
Publicado em: (1990)

Existential second−order logic over strings
Por: Eiter, T, et al.
Publicado em: (2000)

Existential Second−Order Logic over Strings
Por: Eiter, T, et al.
Publicado em: (1998)

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

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

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

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

The Complexity of Nested Counterfactuals and Iterated Knowledge Base Revisions
Por: Eiter, T, et al.
Publicado em: (1993)

The Complexity of Nested Counterfactuals and Iterated Knowledge Base Revisions
Por: Eiter, T, et al.
Publicado em: (1996)

Efficient Datalog Abduction through Bounded Treewidth
Por: Gottlob, G, et al.
Publicado em: (2007)

Abductive reasoning : logical investigations into discovery and explanation /
Por: 375870 Aliseda, Atocha
Publicado em: (2006)

Peirce’s Theory of Abduction: Logic, Methodology, and Instinct
Por: Pablo Aguayo W.
Publicado em: (2011-04-01)

Logic and Abduction: Cognitive Externalizations in Demonstrative Environments
Por: Lorenzo Magnani
Publicado em: (2009-12-01)

On the Complexity of Theory Curbing
Por: Eiter, T, et al.
Publicado em: (2000)

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

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