Abduction in well-founded semantics and generalized stable models via tabled dual programs
From MaRDI portal
Publication:4819009
DOI10.1017/S1471068403001960zbMATH Open1090.68014DBLPjournals/tplp/AlferesPS04OpenAlexW2004486808WikidataQ62038969 ScholiaQ62038969MaRDI QIDQ4819009FDOQ4819009
Authors: José Júlio Alferes, L. M. Pereira, Terrance Swift 
Publication date: 24 September 2004
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s1471068403001960
Recommendations
- Abduction from logic programs: Semantics and complexity
- Abduction via \(C\)-tableaux and \(\delta\)-resolution
- Generalized well-founded semantics for logic programs
- Abduction through semantic tableaux versus abduction through goal-directed proofs
- On the relations between stable and well-founded semantics of logic programs
- Semantics and complexity of abduction from default theories
- A note on the stable model semantics for logic programs
- On generalized well-founded models for logic programs
- Assumption-free Semantics for Ordered Logic Programs: On the Relationship Between Well-founded and Stable Partial Models
Cited In (15)
- Constraint answer set programming without grounding
- Abductive inference in defeasible reasoning: a model for research programmes
- Common-sense reasoning as proto-scientific agent activity
- Implementing Probabilistic Abductive Logic Programming with Constraint Handling Rules
- Observation strategies for event detection with incidence on runtime verification: theory, algorithms, experimentation
- On dual programs in co-logic programming and the Horn \({\mu}\)-calculus
- Integration of Abductive Reasoning and Constraint Optimization in SCIFF
- Model-Baded Abduction via Dual Resolution
- Inspecting side-effects of abduction in logic programs
- Title not available (Why is that?)
- tarfa: Tableaux and Resolution for Finite Abduction
- Computing abduction by using TMS with top-down expectation
- An abductive framework for extended logic programming
- The CIFF proof procedure for abductive logic programming with constraints: Theory, implementation and experiments
- On dual programs in co-logic programming
Uses Software
This page was built for publication: Abduction in well-founded semantics and generalized stable models via tabled dual programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4819009)
