Sciweavers

3658 search results - page 70 / 732
» The logic of proofs, semantically
Sort
View
LISP
2008
165views more  LISP 2008»
13 years 9 months ago
Adapting functional programs to higher order logic
Higher-order logic proof systems combine functional programming with logic, providing functional programmers with a comfortable setting for the formalization of programs, specifica...
Scott Owens, Konrad Slind
CADE
2005
Springer
14 years 9 months ago
Proof Planning for First-Order Temporal Logic
Proof planning is an automated reasoning technique which improves proof search by raising it to a meta-level. In this paper we apply proof planning to First-Order Linear Temporal L...
Claudio Castellini, Alan Smaill
JELIA
2004
Springer
14 years 2 months ago
The CIFF Proof Procedure for Abductive Logic Programming with Constraints
Abstract. We introduce a new proof procedure for abductive logic programming and present two soundness results. Our procedure extends that of Fung and Kowalski by integrating abduc...
Ulrich Endriss, Paolo Mancarella, Fariba Sadri, Gi...
ITP
2010
161views Mathematics» more  ITP 2010»
14 years 1 months ago
Separation Logic Adapted for Proofs by Rewriting
We present a formalisation of separation logic which, by avoiding the use of existential quantifiers, allows proofs that only use standard equational rewriting methods as found in...
Magnus O. Myreen
AISC
2008
Springer
13 years 11 months ago
Mechanising a Proof of Craig's Interpolation Theorem for Intuitionistic Logic in Nominal Isabelle
Craig's Interpolation Theorem is an important meta-theoretical result for several logics. Here we describe a formalisation of the result for first-order intuitionistic logic w...
Peter Chapman, James McKinna, Christian Urban