Bound Founded Answer Set Programming
Rehan Abdul Aziz

TL;DR
This paper introduces Bound Founded Answer Set Programming (BFASP), a new formalism that extends ASP to handle numeric bounds and recursive rules, effectively removing grounding bottlenecks in solving combinatorial problems.
Contribution
The paper proposes BFASP, an extension of ASP that incorporates bounds over numeric variables, addressing limitations in existing stable model semantics.
Findings
BFASP removes grounding bottlenecks in ASP systems.
BFASP can model shortest paths and other recursive numeric problems.
BFASP extends the semantics of ASP to include numeric bounds.
Abstract
Answer Set Programming (ASP) is a powerful modelling formalism that is very efficient in solving combinatorial problems. ASP solvers implement the stable model semantics that eliminates circular derivations between Boolean variables from the solutions of a logic program. Due to this, ASP solvers are better suited than propositional satisfiability (SAT) and Constraint Programming (CP) solvers to solve a certain class of problems whose specification includes inductive definitions such as reachability in a graph. On the other hand, ASP solvers suffer from the grounding bottleneck that occurs due to their inability to model finite domain variables. Furthermore, the existing stable model semantics are not sufficient to disallow circular reasoning on the bounds of numeric variables. An example where this is required is in modelling shortest paths between nodes in a graph. Just as reachability…
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLogic, Reasoning, and Knowledge · Multi-Agent Systems and Negotiation · Logic, programming, and type systems
