ASP (): Answer Set Programming with Algebraic Constraints

DOI10.1017/S1471068420000393zbMath1471.68047arXiv2008.04008MaRDI QIDQ5140023

Thomas Eiter, Rafael Kiesel

Publication date: 13 December 2020

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

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

zbMATH Keywords

constraintsanswer set programminghere-and-there logicweighted logic

Mathematics Subject Classification ID

Logic in computer science (03B70) Logic programming (68N17) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (1)

A general framework for preferences in answer set programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Relating constraint answer set programming languages and algorithms
• Semantics and complexity of recursive aggregates in answer set programming
• Nested expressions in logic programs
• First-order stable model semantics with intensional functions
• Weighted automata and weighted logics
• Vicious Circle Principle and Logic Programs with Aggregates
• Logic programs with propositional connectives and aggregates
• Functional answer set programming
• Semiring-based constraint satisfaction and optimization
• One More Decidable Class of Finitely Ground Programs
• Stable model semantics for founded bounds
• Logic programs with monotone abstract constraint atoms
• Quantified Equilibrium Logic and Foundations for Answer Set Programs
• Strongly equivalent logic programs

This page was built for publication: ASP (): Answer Set Programming with Algebraic Constraints