4513 search results - page 295 / 903 » Logic programming with satisfiability |
191
click to vote
AGP
1994
IEEE
15 years 10 months ago
1994
IEEE
This paper considers compositions of conditional term rewriting systems as a basis for a modular approach to the design and analysis of equational logic programs. In this context,...
180
click to vote
EUSFLAT
2001
15 years 8 months ago
2001
The aim of this paper is to build a formal model for similarity-based fuzzy unification in multi-adjoint logic programs. Specifically, a general framework of logic programming whi...
171
click to vote
CADE
2003
Springer
16 years 7 months ago
2003
Springer
The DPLL procedure is the basis of some of the most successful propositional satisfiability solvers to date. Although originally devised as a proofprocedure for first-order logic, ...
305
click to vote
CP
2009
Springer
16 years 7 months ago
2009
Springer
Abstract. In this paper, we show how model-checking can be generalized to temporal logic constraint solving, by considering temporal logic formulae with free variables over some do...
191
click to vote
ICALP
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. State-based systems and modal logics for reasoning about them often heterogeneously combine a number of features such as non-determinism and probabilities. Here, we show ...