Abduction from logic programs: Semantics and complexity
type: Item
instance of: scholarly article
title: Abduction from logic programs: Semantics and complexity
zbMATH Open document ID: 0893.68022
DOI: 10.1016/S0304-3975(96)00179-X
author: Thomas Eiter
author: Georg Gottlob
author: N. Leone
published in: Theoretical Computer Science
publication date: 1998-06-30T00:00:00Z
Mathematics Subject Classification ID: 68N17
zbMATH DE Number: 1170342
zbMATH Keywords: knowledge representation
zbMATH Keywords: reasoning
describes a project that uses: Datalog
MaRDI profile type: Publication
cites work: Logic programming and knowledge representation
cites work: Generalized disjunctive well-founded semantics for logic programs.
cites work: Stable and extension class theory for logic programs and default logics
cites work: General logical databases and programs: Default logic semantics and stratification
cites work: An abductive framework for extended logic programming
cites work: Q4028775
cites work: The computational complexity of abduction
cites work: The complexity of propositional closed world reasoning and circumscription
cites work: A survey of complexity results for non-monotonic logics
cites work: Q3742757
cites work: On the Relationship Between Abduction and Deduction
cites work: SLDNFA: An abductive procedure for abductive logic programs
cites work: Representing Incomplete Knowledge in Abductive Logic Programming
cites work: On the relations between stable and well-founded semantics of logic programs
cites work: The complexity of logic-based abduction
cites work: On the computational cost of disjunctive logic programming: Propositional case
cites work: Q3983043
cites work: Second order logic and the weak exponential hierarchies
cites work: Abductive Logic Programming
cites work: The expressive power of stratified logic programs
cites work: Abduction versus closure in causal theories.
cites work: On the greedy algorithm for satisfiability
cites work: LOGIDATA+: deductive databases with complex objects
cites work: Q3339245
cites work: Q4391449
cites work: Autoepistemic logic
cites work: Q4273952
cites work: Circumscription - a form of non-monotonic reasoning
cites work: Non-monotonic logic. I
cites work: Q3939270
cites work: Semantical considerations on nonmonotonic logic
cites work: Q3221403
cites work: Q5559213
cites work: Q3998470
cites work: Q5750451
cites work: Q3348437
cites work: Q3983045
cites work: A logic for default reasoning
cites work: An alternative approach to the semantics of disjunctive logic programs and deductive databases
cites work: The expressive powers of the logic programming semantics
cites work: Complexity and undecidability results for logic programming
cites work: Classifying the computational complexity of problems
cites work: Q4131648
cites work: The well-founded semantics for general logic programs
Recommended article: Complexity results for abductive logic programming
Recommended article: Q4707746
Recommended article: Abductive Logic Programming
Recommended article: Q4217935
Recommended article: The complexity of logic-based abduction
Recommended article: Q4281509
Recommended article: A terminological interpretation of (abductive) logic programming
Recommended article: Semantics and complexity of abduction from default theories
Recommended article: An abductive framework for extended logic programming
Recommended article: An abductive approach to disjunctive logic programming
description: scientific article; zbMATH DE number 1170342