scientific article; zbMATH DE number 2080324
From MaRDI portal
zbMath1044.68808MaRDI QIDQ4473043
Publication date: 4 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/1894/18940441.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Logic in artificial intelligence (68T27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
aspartame: Solving Constraint Satisfaction Problems with Answer Set Programming, Compiling finite linear CSP into SAT, Statistical regimes across constrainedness regions, Symmetry definitions for constraint satisfaction problems, Exploiting multivalued knowledge in variable selection heuristics for SAT solvers, A constraint-based approach to learn temporal features on action models from multiple plans, Solving quantified constraint satisfaction problems, \textsc{Conjure}: automatic generation of constraint models from problem specifications, Weighted positive binary decision diagrams for exact probabilistic inference, Automatically improving constraint models in Savile Row, A SAT Approach to Clique-Width, Time-expanded graph-based propositional encodings for makespan-optimal solving of cooperative path finding problems, Modelling Max-CSP as Partial Max-SAT, Clingcon: The next generation, GAC Via Unit Propagation, MUST: Provide a Finer-Grained Explanation of Unsatisfiability, Towards Robust CNF Encodings of Cardinality Constraints, Propagation = Lazy Clause Generation, Constraint CNF: SAT and CSP Language Under One Roof., Constraint and Satisfiability Reasoning for Graph Coloring, Interleaved Alldifferent Constraints: CSP vs. SAT Approaches, Solving constraint satisfaction problems with SAT modulo theories, Automatic generation of redundant models for permutation constraint satisfaction problems, Generalised graph colouring by a hybrid of local search and constraint programming, Argumentation frameworks as constraint satisfaction problems, SampleSearch: importance sampling in presence of determinism, The weighted grammar constraint, Propagation via lazy clause generation, Computing AES related-key differential characteristics with constraint programming, Sequential Encodings from Max-CSP into Partial Max-SAT, Resolution and the binary encoding of combinatorial principles, 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, Methods for solving reasoning problems in abstract argumentation -- a survey, meSAT: multiple encodings of CSP to SAT
