ASSAT: computing answer sets of a logic program by SAT solvers

2004/06/08 by Fangzhen Lin, Yuting Zhao · 1 citation
Computer Science · #Algorithm #Answer set programming #Circumscription #Computer science #Logic programming #Logic, Reasoning, and Knowledge #Logic, programming, and type systems #Multi-Agent Systems and Negotiation #Operational semantics #Programming language #Satisfiability #Semantics (computer science) #Solver #Stable model semantics #Theoretical computer science

paper · pdf · doi:10.1016/j.artint.2004.04.004

openalex publication_date 2004/06/08 · crossref created 2004/06/08 · crossref issued 2004/08/01 · crossref published 2004/08/01 · crossref published-print 2004/08/01 · crossref deposited 2019/02/07 · openalex created_date 2025/10/10 · crossref indexed 2026/07/28 · openalex updated_date 2026/08/02

Citations

• Fages' Theorem and Answer Set Programming
• Negation as Failure
• Depth-First Search and Linear Graph Algorithms

Cited by

• The third open answer set programming competition
• Towards Datalog on Quantum Annealers: Compiling Recursive Logic Programs with Bottom-up Semantics to 2-local Ising Models
• Stable model semantics [wikipedia]