Through the Looking Glass, and what Horn Clause Programs Found There
Paul Tarau

TL;DR
This paper investigates Dual Horn clauses, revealing their symmetries with Horn clauses, and demonstrates their practical applications in constructive negation, explainability in AI, and efficient reasoning with polynomial complexity.
Contribution
It introduces the concept of Dual Horn clauses as a constructive negation tool, provides a compilation scheme to integrate them with Horn clauses, and applies them to enhance AI reasoning and explainability.
Findings
Dual Horn clauses enable constructive falsification explanations.
They have polynomial complexity similar to Horn clauses.
A compilation scheme allows seamless integration with Horn clause programs.
Abstract
Dual Horn clauses mirror key properties of Horn clauses. This paper explores the ``other side of the looking glass'' to reveal some expected and unexpected symmetries and their practical uses. We revisit Dual Horn clauses as enablers of a form of constructive negation that supports goal-driven forward reasoning and is valid both intuitionistically and classically. In particular, we explore the ability to falsify a counterfactual hypothesis in the context of a background theory expressed as a Dual Horn clause program. With Dual Horn clause programs, by contrast to negation as failure, the variable bindings in their computed answers provide explanations for the reasons why a statement is successfully falsified. Moreover, in the propositional case, by contrast to negation as failure as implemented with stable models semantics in ASP systems, and similarly to Horn clause programs, Dual…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAmerican Constitutional Law and Politics
