Results 1 
5 of
5
Records for Logic Programming
 Journal of Logic Programming
, 1994
"... CFT is a new constraint system providing records as logical data structure for constraint (logic) programming. It can be seen as a generalization of the rational tree system employed in Prolog II, where finergrained constraints are used, and where subtrees are identified by keywords rather than by ..."
Abstract

Cited by 101 (19 self)
 Add to MetaCart
(Show Context)
CFT is a new constraint system providing records as logical data structure for constraint (logic) programming. It can be seen as a generalization of the rational tree system employed in Prolog II, where finergrained constraints are used, and where subtrees are identified by keywords rather than by position. CFT is defined by a firstorder structure consisting of socalled feature trees. Feature trees generalize the ordinary trees corresponding to firstorder terms by having their edges labeled with field names called features. The mathematical semantics given by the feature tree structure is complemented with a logical semantics given by five axiom schemes, which we conjecture to comprise a complete axiomatization of the feature tree structure. We present a decision method for CFT, which decides entailment / disentailment between possibly existentially quantified constraints. Since CFT satisfies the independence property, our decision method can also be employed for checking the sat...
A New Method for Undecidability Proofs of First Order Theories
 Journal of Symbolic Computation
, 1992
"... this paper is to define a framework for such reduction proofs. The method proposed is illustrated by proving the undecidability of the theory of a term algebra modulo the axioms of associativity and commutativity and of the theory of a partial lexicographic path ordering. 1. Introduction ..."
Abstract

Cited by 30 (6 self)
 Add to MetaCart
this paper is to define a framework for such reduction proofs. The method proposed is illustrated by proving the undecidability of the theory of a term algebra modulo the axioms of associativity and commutativity and of the theory of a partial lexicographic path ordering. 1. Introduction
A Proof System for Finite Trees
 IN H. KLEINE BUNING, EDITOR, COMPUTER SCIENCE LOGIC `95 , LNCS 1092, PAGES 86105, SPRINGERVERLAG, 1996.
, 1996
"... ..."
First Order Data Types and First Order Logic
, 1991
"... : This paper concerns the relation between parameterized first order data types and first order logic. Augmenting first order logic by data type definitions yields in general a strictly stronger logic than first order logic. We consider some properties of the new logic for fixed data type definition ..."
Abstract
 Add to MetaCart
(Show Context)
: This paper concerns the relation between parameterized first order data types and first order logic. Augmenting first order logic by data type definitions yields in general a strictly stronger logic than first order logic. We consider some properties of the new logic for fixed data type definitions. While our new logic always fulfills the downward SkolemLowenheim property, compactness is fulfilled if and only if for the given data type definition the new logic has the same expressive power than first order logic. We show that this last property is undecidable. Ralf Treinen, Fachbereich 14  Informatik, Im Stadtwald, Universitat des Saarlandes, W6600 Saarbrucken, Germany, treinen@cs.unisb.de A short version appeared in T. Ito and A. R. Meyer, eds., Theoretical Aspects of Computer Software, Sendai, Japan, September 1991, pages 594614, Springer LNCS vol. 526. Contents 1 Introduction 2 2 Preliminaries 3 3 Modules 5 3.1 Syntax : : : : : : : : : : : : : : : : : : : : : : : : : : : ...
Finite and Rational Tree Constraints
"... This paper present * an incremental and Lasy daemon procedure for the fintorder equality theory over a Herforand universe (Clark equality theory) as well as for that of rational trees. The pruceduie is based on a conjunctive normal form and consists of two algorithms, one algorithm to decide satis ..."
Abstract
 Add to MetaCart
(Show Context)
This paper present * an incremental and Lasy daemon procedure for the fintorder equality theory over a Herforand universe (Clark equality theory) as well as for that of rational trees. The pruceduie is based on a conjunctive normal form and consists of two algorithms, one algorithm to decide satisfiability and one for transforming a universally quantified negated constraint into a new constraint in normal form. We will also show that a general formula in either theory can be rewritten into an equivalent normal form, thus providing a general decision procedure. The normal form and the design of the decision procedure have been chosen to meet the requirements of a concurrent constraint Tig language. The problem we are addressing in this paper is to specify an efficient complete decision procedure for the firstorder equality theories over finite and rational trees with infinite signatures. The intention is to use the decision procedure as a complete constraint solver in a concurrent constraint programming language (CCP) [18]. As will be seen,