16 search results - page 2 / 4 » Generalizing DPLL to Richer Logics |
CADE
2009
Springer
14 years 5 months ago
2009
Springer
We present a new calculus for first-order theorem proving with equality, ME+Sup, which generalizes both the Superposition calculus and the Model Evolution calculus (with equality)...
ML
2006
ACM
13 years 4 months ago
2006
ACM
In this paper, we describe the syntax and semantics for a probabilistic relational language (PRL). PRL is a recasting of recent work in Probabilistic Relational Models (PRMs) into ...
ACL
2004
13 years 6 months ago
2004
The purpose of this paper is to re-examine the balance between clarity and efficiency in HPSG design, with particular reference to the design decisions made in the English Resourc...
ENTCS
2008
13 years 4 months ago
2008
Deep inference is a proof theoretical methodology that generalizes the traditional notion of inference in the sequent calculus: in contrast to the sequent calculus, the deductive ...
AAAI
2006
13 years 6 months ago
2006
One important aspect in directing cognitive robots or agents is to formally specify what is expected of them. This is often referred to as goal specification. Temporal logics such...