Weight constraints as nested expressions
From MaRDI portal
Publication:4673539
DOI10.1017/S1471068403001923zbMath1093.68017OpenAlexW2087563242WikidataQ60061162 ScholiaQ60061162MaRDI QIDQ4673539
Vladimir Lifschitz, Paolo Ferraris
Publication date: 29 April 2005
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s1471068403001923
Related Items
Disjunctive Programs with Set Constraints, Finding similar/diverse solutions in answer set programming, Equilibrium logic, Shared aggregate sets in answer set programming, Answer set programming based on propositional satisfiability, Improving the Normalization of Weight Rules in Answer Set Programs, Strong Equivalence and Program Structure in Arguing Essential Equivalence between Logic Programs, Generating explanations for biomedical queries, Abstract gringo, Rewriting recursive aggregates in answer set programming: back to monotonicity, First-order modular logic programs and their conservative extensions, Constraint answer set solver EZCSP and why integration schemas matter, On relation between constraint answer set programming and satisfiability modulo theories, Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs, Synonymous theories and knowledge representations in answer set programming, Computing weighted solutions in ASP: representation-based method vs. search-based method, Answer set programming made easy, What is answer set programming to propositional satisfiability, Weight constraint programs with evaluable functions, Achieving compositionality of the stable model semantics for <scp>smodels</scp> programs, Relating constraint answer set programming languages and algorithms, Inferring phylogenetic trees using answer set programming, On the Implementation of Weight Constraint Rules in Conflict-Driven ASP Solvers, Semantics and complexity of recursive aggregates in answer set programming, Thirteen Definitions of a Stable Model, Probabilistic reasoning with answer sets, Transition systems for model generators—A unifying approach, Unsatisfiable Core Analysis and Aggregates for Optimum Stable Model Search, Vicious circle principle, aggregates, and formation of sets in ASP based languages, Relating weight constraint and aggregate programs: Semantics and representation, Twelve Definitions of a Stable Model, On the Continuity of Gelfond-Lifschitz Operator and Other Applications of Proof-Theory in ASP, The possibilistic Horn non-clausal knowledge bases, Semi-equilibrium models for paracoherent answer set programs
