Semantics and Complexity of Abduction from Default Theories

Semantics and Complexity of Abduction from Default Theories

Show other versions (1)

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

Registos relacionados

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

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

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

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 Logic−Based Abduction
Por: Eiter, T, et al.
Publicado em: (1992)

The Complexity of Default Reasoning under the Stationary Fixed Point Semantics
Por: Gottlob, G
Publicado em: (1995)

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

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)

Well−Founded Semantics for Default Logic
Por: Brewka, G, et al.
Publicado em: (1997)

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

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

Complexity Results for Default Reasoning from Conditional Knowledge Bases
Por: Eiter, T, et al.
Publicado em: (2000)

Default Reasoning from Conditional Knowledge Bases: Complexity and Tractable Cases
Por: Eiter, T, et al.
Publicado em: (2000)

Complexity of Nested Circumscription and Abnormality Theories
Por: Cadoli, M, et al.
Publicado em: (2001)

Complexity of Nested Circumscription and Nested Abnormality Theories
Por: Cadoli, M, et al.
Publicado em: (2002)

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

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

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

Abduction through semantic tableaux versus abduction through goal-directed proofs
Por: Joke Meheus, et al.
Publicado em: (2009-12-01)

Ignorance and Semantic Tableaux: Aliseda on Abduction
Por: John Woods
Publicado em: (2009-12-01)

Cumulative Default Logic: Finite Characterization‚ Algorithms‚ and Complexity
Por: Gottlob, G, et al.
Publicado em: (1994)

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

Complexity of Propositional Knowledge Base Revision
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)

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)

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

New Tractable Cases in Default Reasoning from Conditional Knowledge Bases
Por: Eiter, T, et al.
Publicado em: (2000)

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

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

Character evidence : an abductive theory /
Por: 293412 Walton, Douglas
Publicado em: (2006)

Information Extraction for the Semantic Web
Por: Baumgartner, R, et al.
Publicado em: (2005)

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

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

Translating Default Logic into Standard Autoepistemic Logic
Por: Gottlob, G
Publicado em: (1995)

Abduction: The Logic of Discovery of Grounded Theory
Por: Jo Reichertz
Publicado em: (2009-11-01)

The Complexity of Conjunctive Query Abduction in DL−Lite
Por: Calvanese, D, et al.
Publicado em: (2011)