A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
On completeness of logic programs
[article]
2014
arXiv
pre-print
Preserved Fulltext
Program correctness (in imperative and functional programming) splits in logic programming into correctness and completeness. ...
This paper presents a few sufficient conditions for completeness of definite programs. We also study preserving completeness under some cases of pruning of SLD-trees (e.g. due to using the cut). ...
Introduction The notion of partial program correctness splits in logic programming into correctness and completeness. ...
arXiv:1411.3015v1
fatcat:ri3hmooh25fwhczssgll5lkb5q
On relative completeness of programming logics
1984
Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '84
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Supplying }~oare's system with an oracle answering questions on validity of first-order formulas he was able to separate the reasoning about the programs from the Permission to copy without fee all or ...
In order to show the inherent ccmple~(ity of the problem of partial correctness Cod~ introduced the notion of relative completeness. ...
I. ) Natural question arose for other,more complicated programming languages : does the e~ressiveness stand for the sufficient condition for the existence of relatively complete Hoare's logic ? ...
doi:10.1145/800017.800537
dblp:conf/popl/Grabowski84
fatcat:33pqsrw43nb4lfqmrcprfyfkjy
Correctness and Completeness of Logic Programs
2016
ACM Transactions on Computational Logic
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2014 pre-print arXiv:1412.8739v1 fatcat:a3aabxkjy5gfvddriiinhfaxlyOther Versions
We discuss proving correctness and completeness of definite clause logic programs. ...
Also, we show how to prove completeness and correctness in the presence of SLD-tree pruning, and point out that approximate specifications simplify specifications and proofs. ...
Now we discuss the work on proving correctness and completeness of logic programs. We omit most of those based on operational semantics. ...
doi:10.1145/2898434
fatcat:vhuw4x7jcjhtbginuhgdzphw4y
On strictly arithmetical completeness in logics of programs
1991
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
., On strictly arithmetical comp:eteness in logics of programs. Theoretical Computer Science 79 (1991) 341-355. ...
We present a powerful technique of obtaining strictly arithmetical axiomatizations of logics of programs. ...
The history of development of logics of programs was initiated in the iate sixties and may seem a rather short one. Nevertheless the research on logics of programs was very intensive. ...
doi:10.1016/0304-3975(91)90336-z
fatcat:7jgtoukpircqxkuu5h3x4pyddi
A note on semantics of logic programs with equality based on complete sets of E-unifiers
1996
The Journal of Logic Programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
ANATOLI DEGTYAREV AND ANDREI VORONKOV We discuss semantics of equational Horn-clause programs based on the notion of a complete set of E-unifiers. ...
We also define and compare several fixpoint semantics based on complete sets of E-unifiers. ...
The complete sets of unifiers in logic programming have been considered in [6, 7, 9, 11, 19, 20] . All of these papers except [6, 7] considered restricted classes of logic programs with equality. ...
doi:10.1016/0743-1066(96)00049-0
fatcat:3ym72mrqbvak7dtjfrixjzjjou
On Correctness and Completeness of an n Queens Program
2021
Theory and Practice of Logic Programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Another purpose of the paper is to present an example of precise declarative reasoning about the semantics of a logic program. ...
This paper explains the program in a declarative way and provides proofs of its correctness and completeness. ...
Acknowledgement Comments of anonymous referees and of Michael Maher were instrumental in improving the presentation. ...
doi:10.1017/s1471068421000223
fatcat:cddow7mtrzbpxmc7y2t2tau2eq
Temporal logic programming is complete and expressive
1989
Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '89
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
First, it is one of the smallest extensions of Horn logic programming with temporal operators; it was introduced in [AM87] as a first step towards temporal logic programming. ...
Indeed, in classical logic programming, the operational and the logical semantics coincide because of the completeness of SLD-resolution ( [Hil74] , [Cla79], [AvE82] ). ...
doi:10.1145/75277.75301
dblp:conf/popl/Baudinet89
fatcat:jdmx2mfjpngyvj6s3mpbwiiyca
On the Completeness of Selective Unification in Concolic Testing of Logic Programs
[article]
2016
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We have recently introduced concolic testing in the context of logic programming. ...
In contrast to previous approaches, the key ingredient in this setting is a technique to generate appropriate run-time goals by considering all possible ways an atom can unify with the heads of some program ...
Let
Discussion In this paper, we have studied the soundness and completeness of selective unification, a relevant operation in the context of concolic testing of logic programs. ...
arXiv:1608.03054v1
fatcat:vkhf3v4wmjdevjmx4khyxyltca
On the Completeness of Selective Unification in Concolic Testing of Logic Programs
[chapter]
2017
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We have recently introduced concolic testing in the context of logic programming. ...
In contrast to previous approaches, the key ingredient in this setting is a technique to generate appropriate run-time goals by considering all possible ways an atom can unify with the heads of some program ...
Let
Discussion In this paper, we have studied the soundness and completeness of selective unification, a relevant operation in the context of concolic testing of logic programs. ...
doi:10.1007/978-3-319-63139-4_12
fatcat:q6qcpqhrefeyvgaf4i3ok24u5e
On the completeness of narrowing as the operational semantics of functional logic programming
[chapter]
1993
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
of in nite rewriting w.r.t. a declarative semantics, in the spirit of logic programming. ...
The aim of this paper is to present similar results for functional logic programming. ...
Declarative semantics The declarative semantics of SFL is in the spirit of logic programming. A given program R is viewed as a set of logical assertions, to be interpreted in CAAs. ...
doi:10.1007/3-540-56992-8_14
fatcat:koaepjhtcreqva3yucpflvu5su
On Fixed-Points of Multivalued Functions on Complete Lattices and Their Application to Generalized Logic Programs
2009
SIAM journal on computing (Print)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We show that a multivalued operator can be defined whose fixed-points are in one-to-one correspondence with the models of the logic program. Introduction. ...
Second, we show how these results are applied to a general form of logic programs, where the truth space is a complete lattice. ...
This slight difference has an impact on the set of models of a disjunctive logic program, as we show next. ...
doi:10.1137/070695976
fatcat:on5bfom4x5exddvumb5fqxyhsm
Representing reductions of NP-complete problems in logical frameworks
2003
Proceedings of the 2003 workshop on Mechanized reasoning about languages with variable binding - MERLIN '03
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
Furthermore, any instance of a NP-complete problem can be converted to an instance of another problem in NP in polynomial time. ...
soundness proof in a logical framework. ...
We would like to thank Dana Angluin for raising our interest in studying the relationship between logical frameworks and complexity theory and the many discussions related to the subject. ...
doi:10.1145/976571.976579
dblp:conf/icfp/SchurmannS03
fatcat:4rp7izbzjzd33n2y4gdvujnrni
A Simple Complete Search for Logic Programming 1 Introduction
2017
licensed under Creative Commons License CC-BY Technical Communications of the 33rd International Conference on Logic Programming
unpublished
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
We improve on earlier efforts [5] by combining the hand-off of control with relation definition, and in doing so decrease the amount of interleaving while maintaining a complete search. ...
Here, we present a family of complete interleaving depth-first search strategies for embedded, domain-specific logic languages. ...
The views expressed are those of the authors and do not reflect the official policy or position of the Department of Defense or the U.S. Government. The U.S. ...
fatcat:4g46nugdsnhg3dy3mtif7x4ea4
EPiC Series in Computing Coq without Type Casts: A Complete Proof of Coq Modulo Theory
2017
21st International Conference on Logic for Programming, Artificial Intelligence and Reasoning
unpublished
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
So far, type-checking in CoqMT is known to be decidable in presence of a cumulative hierarchy of universes and weak T-elimination. ...
Further, it has been shown by Wang with a formal proof in Coq that consistency is preserved in presence of weak and strong elimination rules, which actually implies consistency in presence of weak and ...
Programming with CoqMT From its initial version, CoqMT eases the development of libraries with dependent data-types, as exemplified in the dependent vector case study of Figure 3 , where statements and ...
fatcat:iml3juwmojd6vaidh3u5pekksq
Development and Application of Logical Actors Mathematical Apparatus for Logic Programming of Web Agents
[chapter]
2003
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
One of the most interesting and promising approaches to programming Internet agents is logic programming of agents. ...
Many ideas and methods of logic programming of Internet agents based on various modifications of Prolog and non-classical logic (linear, modal, etc.) were developed during the recent decade. ...
One of the most interesting and promising approaches to programming Internet agents is logic programming of agents. ...
doi:10.1007/978-3-540-24599-5_39
fatcat:iddvh4wt25cqdhmkueh6bcy5ey
« Previous
Showing results 1 — 15 out of 894,976 results