300 search results - page 23 / 60 » An extension of the Cayley-Sylvester formula |
CSL
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. We present decision procedures for logical constraints involving collections such as sets, multisets, and fuzzy sets. Element membership in our collections is given by ch...
AAAI
2006
13 years 9 months ago
2006
Recent research shows that SAT (propositional satisfiability) techniques can be employed to build efficient systems to compute answer sets for logic programs. ASSAT and CMODELS ar...
AIML
2006
13 years 9 months ago
2006
In [9] we developed a semantics for quantified relevant logic that uses general frames. In this paper, we adapt that model theory to treat quantified modal logics, giving a complet...
ICTAI
2009
IEEE
14 years 2 months ago
2009
IEEE
In this paper a new learning scheme for SAT is proposed. The originality of our approach arises from its ability to achieve clause learning even if no conflict occurs. This clear...
FM
2009
Springer
14 years 2 months ago
2009
Springer
In Bounded Model Checking both the system model and the checked property are translated into a Boolean formula to be analyzed by a SAT-solver. We introduce a new encoding technique...