2000/03/14 by Deborah East, East, Deborah, Mirosław Truszczyński +2
Computer Science · #Artificial Intelligence (cs.AI) #F.2.2 #F.4.1 #FOS: Computer and information sciences #I.2.3 #I.2.4 #I.2.8 #Logic, Reasoning, and Knowledge #Logic, programming, and type systems #Multi-Agent Systems and Negotiation #cs.AI
paper · pdf · doi:10.48550/arxiv.cs/0003061
6 pages (AAAI format), 4 ps figures; System descriptions and demonstration Session, 8th Intl. Workshop on Non-Monotonic Reasoning
arxiv created 2000/03/14 · openalex publication_date 2000/03/14 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Answer-set programming (ASP) has emerged recently as a viable programming paradigm. We describe here an ASP system, DATALOG with constraints or DC, based on non-monotonic logic. Informally, DC theories consist of propositional clauses (constraints) and of Horn rules. The semantics is a simple and natural extension of the semantics of the propositional logic. However, thanks to the presence of Horn rules in the system, modeling of transitive closure becomes straightforward. We describe the syntax, use and implementation of DC and provide experimental results.