dcs: An Implementation of DATALOG with Constraints
Deborah East, Miroslaw Truszczynski
Abstract
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.
Create a lesson
Related papers
Neos: Learning to Interleave Search and Visual Reasoning
Ekko He, Jack Hong, Shilin Yan et al.
Benchmarking Quantum Kernel SVMs for Credit Card Fraud Detection: Performance Realities Under NISQ Constraints
Hitanshi Arora, Mohit Swarnkar, Aswani Kumar Cherukuri
Understanding Personalization Gains in Whisper
Sergei Katkov, Antonio Liotta
Glasseek: A Transparent Recipe for Training and Trustworthy Evaluation of DeepSearch Agents
Cong Pang, Jiaqi Su, Chengrui Wu et al.
PRAISE: A Reproducible Workflow for Non-Programmer Scientists to Implement Published AI Models
Max Achterweust, Stefan Groot Nibbelink, Vincent J. de Beer et al.
MADDIE: Multi-Agent Drug Discovery Engine
Ye Liu, Reza Averly, Avery Meyer et al.