86 search results - page 1 / 18 » Satisfiability Algorithms and Finite Quantification |
KR
2000
Springer
14 years 2 months ago
2000
Springer
This paper makes three observations with regard to the application of algorithms such as wsat and relsat to problems of practical interest. First, we identify a specific calculati...
IJCSA
2007
13 years 10 months ago
2007
A large number of problems that occur in knowledge-representation, learning, VLSI-design, and other areas of artificial intelligence, are essentially satisfiability problems. The ...
CPAIOR
2008
Springer
14 years 19 days ago
2008
Springer
Abstract. The stochastic satisfiability modulo theories (SSMT) problem is a generalization of the SMT problem on existential and randomized (aka. stochastic) quantification over di...
CHARME
2001
Springer
14 years 2 months ago
2001
Springer
Model checking is the process of verifying whether a model of a concurrent system satisfies a specified temporal property. Symbolic algorithms based on Binary Decision Diagrams (BD...
FOIKS
2006
Springer
14 years 2 months ago
2006
Springer
Abstract. In this paper, we present a syntactic method for solving firstorder equational constraints over term algebras. The presented method exploits a novel notion of quasi-solve...