Sciweavers

5 search results - page 1 / 1
» Translating Higher-Order Clauses to First-Order Clauses
Sort
View
JAR
2008
77views more  JAR 2008»
13 years 4 months ago
Translating Higher-Order Clauses to First-Order Clauses
Interactive provers typically use higher-order logic, while automatic provers typically use first-order logic. In order to integrate interactive provers with automatic ones, it is ...
Jia Meng, Lawrence C. Paulson
ECAI
2010
Springer
13 years 6 months ago
ProbLog Technology for Inference in a Probabilistic First Order Logic
We introduce First Order ProbLog, an extension of first order logic with soft constraints where formulas are guarded by probabilistic facts. The paper defines a semantics for FOPro...
Maurice Bruynooghe, Theofrastos Mantadelis, Angeli...
TOCL
2008
102views more  TOCL 2008»
13 years 4 months ago
Flat and one-variable clauses: Complexity of verifying cryptographic protocols with single blind copying
Cryptographic protocols with single blind copying were defined and modeled by Comon and Cortier using the new class C of first order clauses, which extends the Skolem class. They s...
Helmut Seidl, Kumar Neeraj Verma
ENTCS
2008
140views more  ENTCS 2008»
13 years 4 months ago
Functions and Lazy Evaluation in Prolog
There are several proposals for extending Prolog with functional capabilities. The basic idea is to enlarge the language with function definitions that are translated (or expanded...
Juan Rodríguez-Hortalá, Jaime S&aacu...
FASE
2001
Springer
13 years 9 months ago
A Logic for the Java Modeling Language JML
Abstract. This paper describes a specialised logic for proving specifications in the Java Modeling Language (JML). JML is an interface specification language for Java. It allows ...
Bart Jacobs, Erik Poll