On relation between constraint answer set programming and satisfiability modulo theories

DOI10.1017/S1471068417000114zbMath1379.68285arXiv1702.07461OpenAlexW2593721831MaRDI QIDQ4593096

Yuliya Lierler, Benjamin Susman

Publication date: 9 November 2017

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1702.07461

zbMATH Keywords

satisfiability modulo theoriesconstraint satisfaction processingconstraint answer set programming

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic programming (68N17)

Related Items (2)

A Logic-Based Framework Leveraging Neural Networks for Studying the Evolution of Neurological Disorders ⋮ First-order stable model semantics with intensional functions

Uses Software

• Smodels
• B-Prolog
• SICStus
• SWI-Prolog

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Relating constraint answer set programming languages and algorithms
• Integrating answer set programming and constraint logic programming
• Stable models and difference logic
• Nested expressions in logic programs
• SWI-Prolog
• The language features and architecture of B-Prolog
• SAT Modulo Graphs: Acyclicity
• Answer Set Programming Modulo Acyclicity
• Constraint Answer Set Solving
• Weight constraints as nested expressions
• Conflict-driven ASP solving with external sources
• Logic Programming
• ASP with non-herbrand partial functions: a language and system for practical use
• Well-Founded Semantics and the Algebraic Theory of Non-monotone Inductive Definitions
• Computable Functions in ASP: Theory and Implementation
• Computer Aided Verification

This page was built for publication: On relation between constraint answer set programming and satisfiability modulo theories