174 search results - page 17 / 35 » Existential Fixed-Point Logic |
ITP
2010
15 years 1 months ago
2010
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...
KRDB
2003
14 years 11 months ago
2003
Motivated by the possibilities of applying deductive database technology for efficient query answering in description logics, we present a translation operator µ that transforms...
CSL
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. Graded path quantifiers have been recently introduced and investigated as a useful framework for generalizing standard existential and universal path quantifiers in the b...
AML
2010
14 years 10 months ago
2010
We investigate the development of terms during cut-elimination in first-order logic and Peano arithmetic for proofs of existential formulas. The form of witness terms in cut-free p...
FOIKS
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. We extend the open answer set semantics for programs with generalized literals. Such extended programs (EPs) have interesting properties, e.g. the ability to express infi...