A competitive and cooperative approach to propositional satisfiability-Reference-Cited by-同舟云学术

A competitive and cooperative approach to propositional satisfiability

Published:2006-11 Issue:16 Volume:154 Page:2291-2306
ISSN:0166-218X
Container-title:Discrete Applied Mathematics
language:en
Short-container-title:Discrete Applied Mathematics

Author:

Inoue Katsumi,Soh Takehide,Ueda Seiji,Sasaura Yoshito,Banbara Mutsunori,Tamura Naoyuki

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference40 articles.

1. Y. Asahiro, K. Iwama, E. Miyano, Random generation of test instances with controlled attributes, in: D.S. Johnson, M.A. Trick (Eds.), Cliques, Coloring and Satisfiability: Second DIMACS Implementation Challenge, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 26, American Mathematical Society, Providence, RI, 1996, pp. 377–393.

2. Prolog Cafe;Banbara,2005

3. M. Banbara, N. Tamura, K. Inoue, T. Kawamura, H. Tamaki, HECS: a heterogeneous constraint solver, 〈http://kaminari.istc.kobe-u.ac.jp/hecs/〉.

4. Symbolic model checking without BDDs;Biere,1999

5. Fast planning through planning graph analysis;Blum;Artificial Intelligence,1997

Cited by 14 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. CoVeriTeam: On-Demand Composition of Cooperative Verification Systems;Tools and Algorithms for the Construction and Analysis of Systems;2022

2. Parallel Satisfiability Modulo Theories;Handbook of Parallel Constraint Reasoning;2018

3. Solving Multiobjective Discrete Optimization Problems with Propositional Minimal Model Generation;Lecture Notes in Computer Science;2017

4. Adaptive memory-based local search for MAX-SAT;Applied Soft Computing;2012-08

5. Partitioning Search Spaces of a Randomized Search;Fundamenta Informaticae;2011