Results 31 to 40 of about 6,500,790 (324)
Verification of logic programs
The Journal of Logic Programming, 1999 Summary: We present a proof method in the style of Hoare's logic, aimed at providing a unifying framework for the verification of total correctness of logic and Prolog programs. The method, which relies on purely declarative reasoning, has been designed as a trade-off between expressiveness and ease of use.
PEDRESCHI, DINO, RUGGIERI, SALVATORE
openaire +1 more source
A program logic for resources [PDF]
Theoretical Computer Science, 2007 AbstractWe introduce a reasoning infrastructure for proving statements about resource consumption in a fragment of the Java Virtual Machine Language (JVML). The infrastructure is based on a small hierarchy of program logics, with increasing levels of abstraction: at the top there is a type system for a high-level language that encodes resource ...
D. Aspinall +4 more
openaire +2 more sources
Towards Ethical Machines Via Logic Programming [PDF]
Electronic Proceedings in Theoretical Computer Science, 2019 Autonomous intelligent agents are playing increasingly important roles in our lives. They contain information about us and start to perform tasks on our behalves.
Abeer Dyoub +2 more
doaj +1 more source
The Journal of Logic Programming, 1993 Summary: We present a model for distributed logic programming based on AND- parallelism and on explicit message-passing primitives. The communication mechanism is inspired by \textit{R. Milner}'s CCS [Lect. Notes Comput. Sci. 92 (1980; Zbl 0452.68027)].
BROGI, ANTONIO, R. Gorrieri
openaire +4 more sources
Informatics in Education, 2023 Learning programming logic remains an obstacle for students from different academic fields. Considered one of the essential disciplines in the field of Science and Technology, it is vital to investigate the new tools or techniques used in the teaching ...
Regina Célia Coelho +2 more
doaj +1 more source
Teaching logic programming: a review
CTE Workshop ProceedingsLogic programming constitutes a significant paradigm within computer science, offering a unique approach to programming based on formal logic rather than conventional imperative instructions.
Serhiy O. Semerikov +2 more
doaj +1 more source
Extensional Semantics for Higher-Order Logic Programs with Negation [PDF]
Logical Methods in Computer Science, 2018 We develop an extensional semantics for higher-order logic programs with negation, generalizing the technique that was introduced in [Bezem99,Bezem01] for positive higher-order programs.
Panos Rondogiannis, Ioanna Symeonidou
doaj +1 more source
Theoretical Computer Science, 1992 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Filippenko, I., Morris, F. L.
openaire +3 more sources
Nominal logic programming [PDF]
ACM Transactions on Programming Languages and Systems, 2008 Nominal logic is an extension of first-order logic which provides a simple foundation for formalizing and reasoning about abstract syntax modulo consistent renaming of bound names (that is, α-equivalence). This article investigates logic programming based on nominal logic. We describe some typical nominal logic programs, and develop the model-theoretic,
Cheney, James, Urban, Christian
openaire +5 more sources
Extending Coinductive Logic Programming with Co-Facts [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 We introduce a generalized logic programming paradigm where programs, consisting of facts and rules with the usual syntax, can be enriched by co-facts, which syntactically resemble facts but have a special meaning.
Davide Ancona +2 more
doaj +1 more source