Abduction in well-founded semantics and generalized stable models via tabled dual programs

DOI10.1017/S1471068403001960zbMath1090.68014DBLPjournals/tplp/AlferesPS04OpenAlexW2004486808WikidataQ62038969 ScholiaQ62038969MaRDI QIDQ4819009

Luíz Moniz Pereira, José Júlio Alferes, 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

zbMATH Keywords

well-founded semanticsabductiontabled resolutiongeneralized stable models

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (10)

On dual programs in co-logic programming and the Horn \({\mu}\)-calculus ⋮ Constraint Answer Set Programming without Grounding ⋮ Integration of Abductive Reasoning and Constraint Optimization in SCIFF ⋮ Observation strategies for event detection with incidence on runtime verification: theory, algorithms, experimentation ⋮ Unnamed Item ⋮ On Dual Programs in Co-Logic Programming ⋮ Implementing Probabilistic Abductive Logic Programming with Constraint Handling Rules ⋮ The CIFF proof procedure for abductive logic programming with constraints: Theory, implementation and experiments ⋮ Common-sense reasoning as proto-scientific agent activity ⋮ Abductive inference in defeasible reasoning: a model for research programmes

Uses Software

• Smodels
• XSB

This page was built for publication: Abduction in well-founded semantics and generalized stable models via tabled dual programs