scientific article; zbMATH DE number 2080324

MaRDI QIDQ4473043zbMATH OpenFDO

Authors Toby Walsh

Publication date 4 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/1894/18940441.htm

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic in artificial intelligence (68T27)

Recommendations

• A comparison between SAT and CSP techniques
• On the relations between SAT and CSP enumerative algorithms
• scientific article; zbMATH DE number 1234562
• Theory and Applications of Satisfiability Testing
• Mapping CSP into Many-Valued SAT

Cited in

(47)

• On the relation among answer set solvers
• AND/OR branch-and-bound search for combinatorial optimization in graphical models
• Memory intensive AND/OR search for combinatorial optimization in graphical models
• Weighted positive binary decision diagrams for exact probabilistic inference
• Automatically improving constraint models in Savile Row
• Time-expanded graph-based propositional encodings for makespan-optimal solving of cooperative path finding problems
• A comparison between SAT and CSP techniques
• On the relations between SAT and CSP enumerative algorithms
• A constraint-based approach to learn temporal features on action models from multiple plans
• \textsc{Conjure}: automatic generation of constraint models from problem specifications
• Argumentation frameworks as constraint satisfaction problems
• Propagation via lazy clause generation
• Computing AES related-key differential characteristics with constraint programming
• Methods for solving reasoning problems in abstract argumentation -- a survey
• meSAT: multiple encodings of CSP to SAT
• Exploiting multivalued knowledge in variable selection heuristics for SAT solvers
• Solving quantified constraint satisfaction problems
• Automatic generation of redundant models for permutation constraint satisfaction problems
• Generalised graph colouring by a hybrid of local search and constraint programming
• aspartame: solving constraint satisfaction problems with answer set programming
• Modelling Max-CSP as Partial Max-SAT
• GAC Via Unit Propagation
• MUST: Provide a Finer-Grained Explanation of Unsatisfiability
• Towards Robust CNF Encodings of Cardinality Constraints
• Propagation = Lazy Clause Generation
• Propagation in CSP and SAT
• Interleaved Alldifferent Constraints: CSP vs. SAT Approaches
• Mapping CSP into Many-Valued SAT
• Sequential Encodings from Max-CSP into Partial Max-SAT
• scientific article; zbMATH DE number 1241716 (Why is no real title available?)
• SAT-solving in CSP trace refinement
• scientific article; zbMATH DE number 1759715 (Why is no real title available?)
• \textit{clingcon}: the next generation
• Solving constraint satisfaction problems with SAT modulo theories
• Resolution and the binary encoding of combinatorial principles
• Constraint and satisfiability reasoning for graph coloring
• Constraint CNF: SAT and CSP Language Under One Roof.
• Logic Programming
• Theory and Applications of Satisfiability Testing
• On SAT representations of XOR constraints
• SampleSearch: importance sampling in presence of determinism
• The weighted grammar constraint
• Theory and Applications of Satisfiability Testing
• NACRE -- a nogood and clause reasoning engine
• Compiling finite linear CSP into SAT
• Statistical regimes across constrainedness regions
• Symmetry definitions for constraint satisfaction problems

This page was built for publication:

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