Results 1 
6 of
6
The Semantics Of Constraint Logic Programs
 JOURNAL OF LOGIC PROGRAMMING
, 1996
"... This paper presents for the first time the semantic foundations of CLP in a selfcontained and complete package. The main contributions are threefold. First, we extend the original conference paper by presenting definitions and basic semantic constructs from first principles, giving new and comp ..."
Abstract

Cited by 872 (14 self)
 Add to MetaCart
This paper presents for the first time the semantic foundations of CLP in a selfcontained and complete package. The main contributions are threefold. First, we extend the original conference paper by presenting definitions and basic semantic constructs from first principles, giving new and complete proofs for the main lemmas. Importantly, we clarify which theorems depend on conditions such as solution compactness, satisfaction completeness and independence of constraints. Second, we generalize the original results to allow for incompleteness of the constraint solver. This is important since almost all CLP systems use an incomplete solver. Third, we give conditions on the (possibly incomplete) solver which ensure that the operational semantics is confluent, that is, has independence of literal scheduling.
Correctness of a logic program transformation system
 IBM Research Report RC13496, T.J. Watson Research
, 1987
"... This paper discusses correctness of a simple transformation system for logic programs. The transformation system is based on Unfold/Fold transformations, but differs in the form of folding from Tamaki and Sato’s system. We present three progressively stronger forms of this system and prove progressi ..."
Abstract

Cited by 25 (1 self)
 Add to MetaCart
This paper discusses correctness of a simple transformation system for logic programs. The transformation system is based on Unfold/Fold transformations, but differs in the form of folding from Tamaki and Sato’s system. We present three progressively stronger forms of this system and prove progressively weaker forms of correctness. We give attention to the effects of transformation on finite failure as well as on successful computations. 1
Modularized ContextFree Grammars
 In MOL6  Sixth Meeting on Mathematics of Language
, 1999
"... Given two contextfree grammars (CFGs), G 1 and G 2 , the language generated by the union of the grammars is not the union of the languages generated by each grammar: L(G 1 [ G 2 ) 6= L(G 1 ) [ L(G 2 ). In order to account for modularity of grammars, another way of defining the meaning of grammars ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
(Show Context)
Given two contextfree grammars (CFGs), G 1 and G 2 , the language generated by the union of the grammars is not the union of the languages generated by each grammar: L(G 1 [ G 2 ) 6= L(G 1 ) [ L(G 2 ). In order to account for modularity of grammars, another way of defining the meaning of grammars is needed. This paper adapts results from the semantics of logic programming languages to CFGs. We discuss alternative approaches for defining the denotation of a grammar, culminating in one which we show to be both compositional and fullyabstract. We then show how grammar modules can be defined such that their semantics retains these desirable properties. 1 Introduction This paper provides the mathematical infrastructure required for defining modules in contextfree grammars (CFGs). Our departure point is the belief that any advances in grammar engineering must be preceded by a more theoretical work, concentrating on the semantics of grammars. This view reflects the situation in logic pr...
Compositional Semantics for Linguistic Formalisms
, 1999
"... In what sense is a grammar the union of its rules? This paper adapts the notion of composition, well developed in the context of programming languages, to the domain of linguistic ibrmalisms. We study alternative definitions tbr the semantics of such formalisms, suggesting a denotational semantics t ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
(Show Context)
In what sense is a grammar the union of its rules? This paper adapts the notion of composition, well developed in the context of programming languages, to the domain of linguistic ibrmalisms. We study alternative definitions tbr the semantics of such formalisms, suggesting a denotational semantics that we show to be compositional and fullyabstract. This facilitates a clear, mathematically sound way for defining grammar modularity.
Correctness of a Logic Program Transformation
"... This paper discusses correctness of a simple transformation system for logic programs. The transformation system is based on Unfold/Fold transformations, but differs in the form of folding from Tamaki and Sato's system. We present three progressively stronger forms of this system and prove ..."
Abstract
 Add to MetaCart
This paper discusses correctness of a simple transformation system for logic programs. The transformation system is based on Unfold/Fold transformations, but differs in the form of folding from Tamaki and Sato's system. We present three progressively stronger forms of this system and prove progressively weaker forms of correctness. We give attention to the effects of transformation on finite failure as well as on successful computations.
Compositional Semantics for Unificationbased Linguistic Formalisms
, 1999
"... Contemporary linguistic formalisms have become so rigorous that it is now possible to view them as very high level declarative programming languages. Consequently, grammars for natural languages can be viewed as programs; this view enables the application of various methods and techniques that were ..."
Abstract
 Add to MetaCart
(Show Context)
Contemporary linguistic formalisms have become so rigorous that it is now possible to view them as very high level declarative programming languages. Consequently, grammars for natural languages can be viewed as programs; this view enables the application of various methods and techniques that were proved useful for programming languages to the study of natural languages. This paper adapts the notion of program composition, well developed in the context of logic programming languages, to the domain of linguistic formalisms. We study alternative definitions for the semantics of such formalisms, suggesting a denotational semantics that we show to be compositional and fullyabstract. This facilitates a clear, mathematically sound way for defining grammar modularity.