On the duality of abduction and model generation in a framework for model generation with equality

DOI10.1016/0304-3975(94)90208-9zbMath0801.68024OpenAlexW2061817439MaRDI QIDQ1314425

Marc Denecker, Danny De Schreye

Publication date: 29 November 1994

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://lirias.kuleuven.be/handle/123456789/125200

zbMATH Keywords

dualitylogic programmingabductionprocedural semanticsmodel generation

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (2)

Representing and building models for decidable subclasses of equational clausal logic ⋮ Minimal model generation with positive unit hyper-resolution tableaux

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• About the rewriting systems produced by the Knuth-Bendix completion algorithm
• On the Relationship Between Abduction and Deduction
• Making prolog more expressive
• SLDNFA: An abductive procedure for abductive logic programs
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• An Efficient Unification Algorithm
• Short note preferred extensions are partial stable models
• The Semantics of Predicate Logic as a Programming Language
• Efficient ground completion

This page was built for publication: On the duality of abduction and model generation in a framework for model generation with equality