A SAT-Based Decision Procedure for the Boolean Combination of Difference Constraints
- 1 January 2005
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- The Essentials of the SAT 2003 CompetitionPublished by Springer Nature ,2004
- Theory and Applications of Satisfiability TestingLecture Notes in Computer Science, 2004
- Efficient solution techniques for disjunctive temporal reasoning problemsArtificial Intelligence, 2003
- Deciding Separation Formulas with SATPublished by Springer Nature ,2002
- A SAT Based Approach for Solving Formulas over Boolean and Linear Mathematical PropositionsPublished by Springer Nature ,2002
- ChaffPublished by Association for Computing Machinery (ACM) ,2001
- SAT-Based Procedures for Temporal ReasoningPublished by Springer Nature ,2000
- GRASP: a search algorithm for propositional satisfiabilityIEEE Transactions on Computers, 1999
- HYBRID ALGORITHMS FOR THE CONSTRAINT SATISFACTION PROBLEMComputational Intelligence, 1993
- Temporal constraint networksArtificial Intelligence, 1991