174 search results - page 6 / 35 » Loop Calculus for Satisfiability |
163
Voted
AAAI
1994
15 years 7 months ago
1994
In this paper we consider updates that are specified as rules and consider simple knowledge bases consisting of ground atoms. We present a translation of the rule based update spe...
283
click to vote
ENTCS
2002
15 years 5 months ago
2002
The paper presents approaches to the validation of optimizing compilers. The emphasis is on aggressive and architecture-targeted optimizations which try to obtain the highest perf...
140
Voted
CADE
2003
Springer
16 years 6 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, ...
146
Voted
BIRTHDAY
2009
Springer
16 years 18 days ago
2009
Springer
We study Nonassociative Lambek Calculus with additives ∧, ∨, satisfying the distributive law (Distributive Full Nonassociative Lambek Calculus DFNL). We prove that categorial g...
169
Voted
CORR
2006
Springer
15 years 5 months ago
2006
Springer
: This paper is concerned with the foundations of the Calculus of Algebraic Constructions (CAC), an extension of the Calculus of Constructions by inductive data types. CAC generali...