27 search results - page 2 / 6 » A proof of completeness for continuous first-order logic |
CADE
2007
Springer
14 years 6 months ago
2007
Springer
We present a method for proving rigid first order theorems by encoding them as propositional satisfiability problems. We encode the existence of a first order connection tableau an...
CSL
2001
Springer
13 years 10 months ago
2001
Springer
Abstract. In classical approaches to knowledge representation, reasoners are assumed to derive all the logical consequences of their knowledge base. As a result, reasoning in the ...
CSFW
2003
IEEE
13 years 11 months ago
2003
IEEE
SPKI/SDSI is a language for expressing distributed access control policy, derived from SPKI and SDSI. We provide a first-order logic (FOL) semantics for SDSI, and show that it ha...
FROCOS
2000
Springer
13 years 10 months ago
2000
Springer
We define a sound and complete logic, called FO , which extends classical first-order predicate logic with intuitionistic implication. As expected, to allow the interpretation of i...
IJCAI
2007
13 years 7 months ago
2007
We present a fully connectionist system for the learning of first-order logic programs and the generation of corresponding models: Given a program and a set of training examples,...