Results 1  10
of
9,630
Binary decision diagrams for first order predicate logic
 JOURNAL OF LOGIC AND ALGEBRAIC PROGRAMMING 57:1–22
, 2003
"... We present an extension of Binary Decision Diagrams (BDDs) such that they can be used for predicate logic. We present a sound and complete proof search method which we apply to a number of examples. ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
We present an extension of Binary Decision Diagrams (BDDs) such that they can be used for predicate logic. We present a sound and complete proof search method which we apply to a number of examples.
Binary decision diagrams for firstorder predicate logic
 THE JOURNAL OF LOGIC AND ALGEBRAIC PROGRAMMING
, 2003
"... ..."
Expressing Set Theory in FirstOrder Predicate Logic
, 2000
"... Here we present a firstorder formalization of set theory that has a finite number of axioms and which syntax is similar to the one often used in books: it provides an encoding of the comprehension symbol. Other formalizations of set theory exist: Zermelo theory with existence axioms is firstorder ..."
Abstract
 Add to MetaCart
Here we present a firstorder formalization of set theory that has a finite number of axioms and which syntax is similar to the one often used in books: it provides an encoding of the comprehension symbol. Other formalizations of set theory exist: Zermelo theory with existence axioms is firstorder
Translating the Object Constraint Language into Firstorder Predicate Logic
 In Proceedings, VERIFY, Workshop at Federated Logic Conferences (FLoC
, 2002
"... In this paper, we define a translation of UML class diagrams with OCL constraints into firstorder predicate logic. The goal is logical reasoning about UML models, realized by an interactive theorem prover. We put an emphasis on usability of the formulas resulting from the translation, and we hav ..."
Abstract

Cited by 40 (6 self)
 Add to MetaCart
In this paper, we define a translation of UML class diagrams with OCL constraints into firstorder predicate logic. The goal is logical reasoning about UML models, realized by an interactive theorem prover. We put an emphasis on usability of the formulas resulting from the translation, and we
DT  An Automated Theorem Prover for MultipleValued FirstOrder Predicate Logics
 IN PROC. 26TH INTERNATIONAL SYMPOSIUM ON MULTIPLEVALUED LOGICS
, 1996
"... We describe the automated theorem prover "Deep Thought" ( d DT ). The prover can be used for arbitrary multiplevalued firstorder logics, provided the connectives can be defined by truth tables and the quantifiers are generalizations of the classical universal resp. existential quantifie ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
quantifiers. d DT has been tested with many interesting multiplevalued logics as well as classical firstorder predicate logic. d DT uses a freevariable semantic tableau calculus with generalized signs. For the existential tableaurules two liberalized versions are implemented. The system utilizes a static
ILPbased Inference for Costbased Abduction on Firstorder Predicate Logic
"... Abduction is desirable for many natural language processing (NLP) tasks. While recent advances in largescale knowledge acquisition warrant applying abduction with large knowledge bases to reallife NLP problems, as of yet, no existing approach to abduction has achieved the efficiency necessary to ..."
Abstract
 Add to MetaCart
to be a practical solution for largescale reasoning on reallife problems. In this paper, we propose an efficient solution for largescale abduction. The contributions of our study are as follows: (i) we propose an efficient method of costbased abduction in rstorder predicate logic that avoids
Charaterising ObjectBased Frameworks in FirstOrder Predicate Logic
"... In the componentbased approach Catalysis, a framework is a reusable artefact that can be adapted and composed into larger systems. The signed contract between components specifies how the required properties of one component are satisfied by the provided properties of another. We examine this conce ..."
Abstract
 Add to MetaCart
this concept in the context of frameworkbased development. Although Catalysis advocates rigorous development, frameworks lack a comprehensive formal foundation. We consider a simplified view of frameworks and their transformation into firstorder logic. Theorem proving may be used to check the consistency
A Domainindependent System for Modeling Number Theory Using FirstOrder Predicate Logic
, 1999
"... Many existing theorem provers employ domaindependent knowledge in their aim to model the reasoning methods of mathematics. In hoping to achieve the same objective, yet in a better way, the present work seeks to provide a domainindependent system of theorems for modeling number theory using firsto ..."
Abstract
 Add to MetaCart
Many existing theorem provers employ domaindependent knowledge in their aim to model the reasoning methods of mathematics. In hoping to achieve the same objective, yet in a better way, the present work seeks to provide a domainindependent system of theorems for modeling number theory using firstorder
Dynamic Predicate Logic
, 1990
"... This paper is devoted to the formulation and investigation of a dynamic semantic interpretation of the language of firstorder predicate logic. The resulting system, which will be referred to as `dynamic predicate logic', is intended as a first step towards a compositional, nonrepresentational ..."
Abstract

Cited by 462 (2 self)
 Add to MetaCart
This paper is devoted to the formulation and investigation of a dynamic semantic interpretation of the language of firstorder predicate logic. The resulting system, which will be referred to as `dynamic predicate logic', is intended as a first step towards a compositional, non
The Semantics of Predicate Logic as a Programming Language
 JOURNAL OF THE ACM
, 1976
"... Sentences in firstorder predicate logic can be usefully interpreted as programs In this paper the operational and fixpoint semantics of predicate logic programs are defined, and the connections with the proof theory and model theory of logic are investigated It is concluded that operational seman ..."
Abstract

Cited by 808 (18 self)
 Add to MetaCart
Sentences in firstorder predicate logic can be usefully interpreted as programs In this paper the operational and fixpoint semantics of predicate logic programs are defined, and the connections with the proof theory and model theory of logic are investigated It is concluded that operational
Results 1  10
of
9,630