Unifying framework for optimizations in non-Boolean formalisms

DOI10.1017/S1471068422000400MaRDI QIDQ7027176zbMATH OpenFDO

Authors Yuliya Lierler

Publication date 14 February 2025

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

Full work available at URL https://doi.org/10.1017/S1471068422000400

zbMATH Keywords

extended weight systemsknowledge representationnonmonotonic reasoning

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic in artificial intelligence (68T27) Knowledge representation (68T30)

Cites work

• \textit{clingcon}: the next generation
• An abstract view on optimizations in SAT and ASP
• ASP modulo CSP: the clingcon system
• scientific article; zbMATH DE number 3793772 (Why is no real title available?)
• Nested expressions in logic programs
• On relation between constraint answer set programming and satisfiability modulo theories
• On SAT Modulo Theories and Optimization Problems
• Optimization in SMT with \(\mathcal{LA}(\mathbb Q)\) cost functions
• Relating constraint answer set programming languages and algorithms
• Transition systems for model generators -- a unifying approach

This page was built for publication: Unifying framework for optimizations in non-Boolean formalisms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7027176)