An empirical study of constraint logic programming and answer set programming solutions of combinatorial problems
From MaRDI portal
(Redirected from Publication:3638568)
Recommendations
- scientific article; zbMATH DE number 1696768
- scientific article; zbMATH DE number 1954119
- scientific article; zbMATH DE number 2096830
- Representing constraint satisfaction problems in answer set programming
- scientific article; zbMATH DE number 555223
- scientific article; zbMATH DE number 1478235
- A synthesis of constraint satisfaction and constraint solving
- Logic Programming
- Constraint satisfaction using constraint logic programming
Cites work
- A comparative study of eight constraint programming languages over the Boolean and finite domains
- A Computing Procedure for Quantification Theory
- A machine program for theorem-proving
- Answer set programming based on propositional satisfiability
- ASSAT: computing answer sets of a logic program by SAT solvers
- Autoepistemic logic
- scientific article; zbMATH DE number 1368933 (Why is no real title available?)
- scientific article; zbMATH DE number 1884393 (Why is no real title available?)
- scientific article; zbMATH DE number 2090520 (Why is no real title available?)
- Logic Programming
- Logic Programming
- Logic Programming
- Logic Programming and Nonmonotonic Reasoning
- On benchmarking constraint logic programming platforms. Response to Fernández and Hill's ``A comparative study of eight constraint programming languages over the Boolean and finite domains
- Theory and Applications of Satisfiability Testing
- Why are there so many loop formulas?
Cited in
(10)- A comparative study of eight constraint programming languages over the Boolean and finite domains
- Combining Heuristics for Configuration Problems Using Answer Set Programming
- Multivalued action languages with constraints in CLP(FD)
- RASP and ASP as a fragment of linear logic
- Distributed answer set coloring: stable models computation via graph coloring
- Logic Programming
- Weight constraint programs with evaluable functions
- A job-shop scheduling approach for optimising sugarcane rail operations
- Answer set planning: a survey
- Constraint answer set programming: integrational and translational (or SMT-based) approaches
This page was built for publication: An empirical study of constraint logic programming and answer set programming solutions of combinatorial problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3638568)