Filters








30,596 Hits in 7.8 sec

A declarative semantics for depth-first logic programs1The research reported here is based on Ref. [12].1

Birgit Elbl
1999 The Journal of Logic Programming  
Depth-®rst evaluation causes a gap between the result of the computation and the classical declarative semantics for logic programs.  ...  The paper presents a new semantics for logic programs closing that gap.  ...  Calculus LPC Proof of 4.1: (Derived existential rules) First we show Exe 6 e in the presence of -axioms for every goal e not containing x. The direction e A Exe is immediate using the A E rule.  ... 
doi:10.1016/s0743-1066(98)10040-7 fatcat:ayyqgmviynb3viq3en4lqhgw2e

Page 5092 of Mathematical Reviews Vol. , Issue 2000g [page]

2000 Mathematical Reviews  
(D-BND2I; Neubiberg/Munich) A declarative semantics for depth-first logic programs.  ...  Logic Programming 41 (1999), no. 1, 27-66. Summary: “Depth-first evaluation causes a gap between the result of the computation and the classical declarative semantics for logic programs.  ... 

Page 7648 of Mathematical Reviews Vol. , Issue 95m [page]

1995 Mathematical Reviews  
The well founded semantics (WFS) is widely regarded as a nat- ural and robust declarative semantics for general logic programs.  ...  Summary: “The depth-first search strategy used by PROLOG is supplemented by depth-first iterative-deepening A*, which is com- plete, i.e. it always succeeds in executing a correct program if enough time  ... 

A Deterministic Logical Semantics for Esterel

Olivier Tardieu
2005 Electronical Notes in Theoretical Computer Science  
On the one hand, the logical behavioral semantics provides a simple and compact formalization of the behavior of programs using SOS rules.  ...  In this work, we construct and thoroughly analyze a new deterministic semantics for Esterel that retains the simplicity of the logical behavioral semantics, from which it derives.  ...  For example, trap T in trap U in exit T 1 has depth 1 because of the declaration of U || exit U 0 has depth 0 || exit V 3 could have any depth greater or equal to 2 end; exit T 0 has depth 0 end Such a  ... 
doi:10.1016/j.entcs.2004.09.040 fatcat:72bzlw5dtzb57bdsfxxubwhdl4

Abstract Diagnosis of First Order Functional Logic Programs [chapter]

Giovanni Bacci, Marco Comini
2011 Lecture Notes in Computer Science  
We present a generic scheme for the abstract debugging of functional logic programs.  ...  We associate to programs a semantics based on a (continuous) immediate consequence operator, P R , which models correctly the powerful features of modern functional logic languages (non-deterministic,  ...  Thus we first introduce a (continuous) immediate consequence operator P R to a given functional logic program R which allows us to derive the concrete semantics for R.  ... 
doi:10.1007/978-3-642-20551-4_14 fatcat:pjrp5nrhfbdvrkq6zoucyy23jy

A European computer industry

1970 Physics Bulletin  
We define a notion of well-typing, which relates type declarations for predicates in the program to an approximation of the denotation of the type completed program.  ...  We introduce polymorphically typed logic programs, an integration of a polymorphic type system with logic programs.  ...  Acknowledgements We would like to thank Mark Miller for his ideas, Moshe Vardi, Frank Pfenning and Marc Dennecker for useful discussions, as well as Kim Marriot and anonymous referees for helpful comments  ... 
doi:10.1088/0031-9112/21/4/002 fatcat:k3jjyvpmejgepitrn6tp45kvpy

A bottom-up polymorphic type inference in logic programming

Roberto Barbuti, Roberto Giacobazzi
1992 Science of Computer Programming  
We present a type inference system for Horn clause logic programs, based on a bottom-up abstract interpretation technique.  ...  This is useful to make the inference appropriate for different purposes. Due to the semantic basis, the system declaratively handles type union and parametric polymorphism.  ...  In the following sections we introduce a declarative semantics for logic programs adequate for semantics-based program analyses and the main ideas of a framework for bottom-up logic program analysis based  ... 
doi:10.1016/0167-6423(92)90038-d fatcat:azxbd5i5u5cyfd2i3ylnsvgr7i

Integration of functional and logic programming

Michael Hanus, Herbert Kuchen
1996 ACM Computing Surveys  
In Prolog, which is still the standard language for logic programming, non-deterministic search is implemented via backtracking, which corresponds to a depth-first search traversal through the SLD proof  ...  Moreover, it is a good basis to teach the ideas of functional and logic programming, or declarative programming in general, with a single computation model and programming language [Han97].  ...  Curry's semantics is sound in the sense of logic programming, i.e., each computed result is correct and for each correct result there is a more general computed one [AEH00] .  ... 
doi:10.1145/234528.234734 fatcat:o34vgwwnbbcllnwozymoizu3am

Page 3443 of Mathematical Reviews Vol. , Issue 99e [page]

1999 Mathematical Reviews  
We propose a semantics for Prolog programs based on a four-valued logic.  ...  Summary: “The coincidence of the declarative and procedural in- terpretations of logic programs does not apply to Prolog programs, due to the depth-first left-to-right evaluation strategy of Prolog in-  ... 

A multiple-valued logical semantics for Prolog [chapter]

Roberto Barbuti, Paolo Mancarella
1996 Lecture Notes in Computer Science  
We propose a new semantics for Prolog programs based on a new fourvalued logic.  ...  The coincidence of the declarative and procedural interpretations of logic programs does not apply to Prolog programs, due to the depth-first left-to-right evaluation strategy of Prolog interpreters.  ...  We thank Paola Quaglia for helpful discussions on the subject of this work. We also thank the anonymous referees for their comments and suggestions.  ... 
doi:10.1007/3-540-61055-3_29 fatcat:542broaa7zc4jojr2nechzh7jm

Complete extension of general logic programs

Bernhard Gil
1992 Theoretical Computer Science  
., Complete extension of general logic programs, Theoretical Computer Science 94 (1992) 28 l-294. We define in this paper a system of axioms for any general logic program.  ...  With regard to this declarative semantics, as well as to the Clark's completed data bases one, the SLDNF procedural interpretation is sound.  ...  One of the major problems of logic programming is to give a suitable declarative semantics to every logic program [lo] .  ... 
doi:10.1016/0304-3975(92)90039-i fatcat:tss7i65dqba4dkjicsj2gidwhi

Page 144 of Journal of Research and Practice in Information Technology Vol. 18, Issue 3 [page]

1986 Journal of Research and Practice in Information Technology  
whilst using a depth-first computation rule.  ...  In particular, investigation of intelligent backtracking under a depth-first computation rule has shown that it is potentially very powerful.  ... 

Operationalizing Declarative and Procedural Knowledge: a Benchmark on Logic Programming Petri Nets (LPPNs) [article]

Giovanni Sileno
2020 arXiv   pre-print
The paper reports on an experiment conducted with a propositional version of Logic Programming Petri Nets (LPPNs), a notation extending Petri Nets with logic programming constructs.  ...  Two semantics are presented: a denotational semantics that fully maps the notation to ASP via Event Calculus; and a hybrid operational semantics that process separately the causal mechanisms via Petri  ...  Logic Programming Petri Nets Logic Programming Petri Nets (LPPNs) are a visual notation first introduced in [22] as an common representational ground where to align representations of law (norms), of  ... 
arXiv:1701.07657v2 fatcat:tk6iqi6kpzdpbn3jau2znnj7la

Guest editor's introduction

Pascal Van Hentenryck
1993 The Journal of Logic Programming  
Prolog, by imposing further restrictions on logic programming such as a depth-first search strategy and a left-to-right computation rule, achieves a compromise between expressiveness and efficiency that  ...  From a semantic standpoint, CLP generalizes and simplifies the theory of logic programming because constraints are conceptually simpler than unifiers.  ...  Prolog, by imposing further restrictions on logic programming such as a depth-first search strategy and a left-to-right computation rule, achieves a compromise between expressiveness and efficiency that  ... 
doi:10.1016/0743-1066(93)90042-f fatcat:qvzctk4dyjbaxpxzoggj6awny4

Page 4267 of Mathematical Reviews Vol. , Issue 95g [page]

1995 Mathematical Reviews  
Summary: “Declarative semantics gives the meaning of a logic program in terms of properties, while the procedural semantics gives the meaning in terms of the execution or evaluation of the program.  ...  To this end, we generalize (to the class of extended logic programs) the definition of a signing, first formulated by Kunen for general programs, and establish a theorem characterizing a restricted monotonicity  ... 
« Previous Showing results 1 — 15 out of 30,596 results