Constraint answer set programming: integrational and translational (or SMT-based) approaches
From MaRDI portal
Cites work
- \textit{clingcon}: the next generation
- A translational approach to constraint answer set solving
- Achievements in answer set programming
- An empirical study of constraint logic programming and answer set programming solutions of combinatorial problems
- Answer set programming and plan generation
- Answer set programming modulo acyclicity
- Applying visible strong equivalence in answer-set program transformations
- ASP with non-herbrand partial functions: a language and system for practical use
- ASP-Core-2 input language format
- aspartame: solving constraint satisfaction problems with answer set programming
- CASP solutions for planning in hybrid domains
- Clingo goes linear constraints over reals and integers
- Computable Functions in ASP: Theory and Implementation
- Computer Aided Verification
- Computing Stable Models via Reductions to Difference Logic
- Conflict-Driven Answer Set Enumeration
- Constraint answer set solver EZCSP and why integration schemas matter
- Constraint Answer Set Solving
- Design and results of the Fifth Answer Set Programming Competition
- Extending the Smodels system with cardinality and weight constraints
- External sources of knowledge and value invention in logic programming
- scientific article; zbMATH DE number 3466489 (Why is no real title available?)
- scientific article; zbMATH DE number 1368933 (Why is no real title available?)
- scientific article; zbMATH DE number 3895002 (Why is no real title available?)
- scientific article; zbMATH DE number 5212421 (Why is no real title available?)
- Industrial-size scheduling with ASP+CP
- Integrating answer set programming and constraint logic programming
- Linear integer arithmetic revisited
- Logic Programming
- Logic programs with stable model semantics as a constraint programming paradigm
- Modular answer set programming as a formal specification language
- Nested expressions in logic programs
- On elementary loops of logic programs
- On relation between constraint answer set programming and satisfiability modulo theories
- On the Implementation of Weight Constraint Rules in Conflict-Driven ASP Solvers
- Planning as satisfiability: heuristics
- Relating constraint answer set programming languages and algorithms
- Solving SAT and SAT modulo theories, from an abstract Davis-Putnam-Logemann-Loveland procedure to \(\operatorname{DPLL}(T)\)
- Some (in)translatability results for normal logic programs and propositional theories
- Stable models and difference logic
- SWI-Prolog
- System \textsc{aspmt2smt}: computing ASPMT theories by SMT solvers
- Team-building with answer set programming in the Gioia-Tauro seaport
- The language features and architecture of B-Prolog
- The traveling salesman problem and its variations.
- Train scheduling with hybrid ASP
- Transition systems for model generators -- a unifying approach
- Unsatisfiability-based optimization in clasp
- Verifying Tight Logic Programs with anthem and vampire
- Weight constraints as nested expressions
- What is answer set programming to propositional satisfiability
Cited in
(2)
This page was built for publication: Constraint answer set programming: integrational and translational (or SMT-based) approaches
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7027224)
