From felicitous models to answer set programming

DOI10.1007/978-3-031-29415-0_5MaRDI QIDQ6911828zbMATH OpenFDO

Authors Vladimir Lifschitz

Publication date 24 October 2025

Full work available at URL https://doi.org/10.1007/978-3-031-29415-0_5

zbMATH Keywords

combinatorial searchlogic programmingstable models

Mathematics Subject Classification ID

History of computer science (68-03) Logic programming (68N17)

Cites work

• A logic for default reasoning
• A new logical characterisation of stable models and answer sets
• Abstract gringo
• Answer set programming
• Connecting first-order ASP and the logic FO(ID) through reducts
• Die formalen Regeln der intuitionistischen Logik. I, II, III.
• scientific article; zbMATH DE number 4199654 (Why is no real title available?)
• scientific article; zbMATH DE number 4128783 (Why is no real title available?)
• scientific article; zbMATH DE number 1368933 (Why is no real title available?)
• Inferring phylogenetic trees using answer set programming
• Logic programs with stable model semantics as a constraint programming paradigm
• Nested expressions in logic programs
• Reducibility among combinatorial problems
• Strongly equivalent logic programs
• The design of the Seventh Answer Set Programming Competition
• The DLV system for knowledge representation and reasoning
• The Semantics of Predicate Logic as a Programming Language
• Verifying Tight Logic Programs with anthem and vampire

This page was built for publication: From felicitous models to answer set programming

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