Automated reformulation of specifications by safe delay of constraints
From MaRDI portal
Publication:2457622
DOI10.1016/j.artint.2006.01.008zbMath1131.68096OpenAlexW2109940223MaRDI QIDQ2457622
Publication date: 23 October 2007
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2006.01.008
modellingsecond-order logicconstraint satisfaction problemspropositional satisfiabilityreformulation
Logic in artificial intelligence (68T27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (3)
Expressive power and abstraction in Essence ⋮ Evaluating ASP and commercial solvers on the CSPLib ⋮ Exploiting functional dependencies in declarative problem specifications
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A theory of abstraction
- Increasing constraint propagation by redundant modeling: An experience report
- Combining the scalability of local search with the pruning techniques of systematic search
- Logic programs with stable model semantics as a constraint programming paradigm
- Compiling problem specifications into SAT
- Permutation Problems and Channelling Constraints
- On conjunctive queries containing inequalities
- Equivalences Among Relational Expressions with the Union and Difference Operators
- Equivalences among Relational Expressions
- The DLV system for knowledge representation and reasoning
- Theory and Applications of Satisfiability Testing
- Logics in Artificial Intelligence
- Symmetry Breaking and Local Search Spaces
- AI*IA 2005: Advances in Artificial Intelligence
- Logic Based Program Synthesis and Transformation
This page was built for publication: Automated reformulation of specifications by safe delay of constraints
