Results 31 to 40 of about 6,681,112 (349)
On Verification of PLC-Programs Written in the LD-Language
Моделирование и анализ информационных систем, 2015 We discuss some questions connected with the construction of a technology of analysing correctness of Programmable Logic Controller programs. We consider an example of modeling and automated verification of PLC-programs written in the Ladder Diagram ...
E. V. Kuzmin, V. A. Sokolov
doaj +3 more sources
Automated termination proofs for logic programs by term rewriting [PDF]
TOCL, 2008 There are two kinds of approaches for termination analysis of logic programs: “transformational” and “direct” ones. Direct approaches prove termination directly on the basis of the logic program. Transformational approaches transform a logic program into
Peter Schneider-Kamp +3 more
semanticscholar +1 more source
A History of Probabilistic Inductive Logic Programming
Frontiers in Robotics and AI, 2014 The field of Probabilistic Logic Programming (PLP) has seen significant advances in the last 20 years, with many proposals for languages that combine probability with logic programming.
Fabrizio eRiguzzi +2 more
doaj +1 more source
Bialgebraic Semantics for Logic Programming [PDF]
Logical Methods in Computer Science, 2015 Bialgebrae provide an abstract framework encompassing the semantics of different kinds of computational models. In this paper we propose a bialgebraic approach to the semantics of logic programming.
Filippo Bonchi, Fabio Zanasi
doaj +1 more source
Proceedings, 2019 When it comes to the writing of a new logic program or theory, it is of great importance to obtain a concise and minimal representation, for simplicity and ease of interpretation reasons.
Rodrigo Martin, Pedro Cabalar
doaj +1 more source
A First Step to the Categorical Logic of Quantum Programs
Entropy, 2020 The long-term goal of our research is to develop a powerful quantum logic which is useful in the formal verification of quantum programs and protocols.
Xin Sun, Feifei He
doaj +1 more source
On the Strong Equivalences of LPMLN Programs [PDF]
Electronic Proceedings in Theoretical Computer Science, 2019 By incorporating the methods of Answer Set Programming (ASP) and Markov Logic Networks (MLN), LPMLN becomes a powerful tool for non-monotonic, inconsistent and uncertain knowledge representation and reasoning.
Bin Wang +3 more
doaj +1 more source
Journal of Logic and Computation, 1992 The paper is a survey and critical overview of recent work on the extension of logic programming to perform abductive reasoning (abductive logic programming). We outline the general framework of abduction and its applications to knowledge assimilation and default reasoning; and we introduce an argumentation-theoretic approach to the use of abduction as
Kakas, Antonis C. +5 more
openaire +4 more sources
Embedding defeasible logic into logic programming [PDF]
Theory and Practice of Logic Programming, 2006 To appear in Theory and Practice of Logic ...
Antoniou, Grigoris +3 more
openaire +3 more sources
Equivalence of two Fixed-Point Semantics for Definitional Higher-Order Logic Programs [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 Two distinct research approaches have been proposed for assigning a purely extensional semantics to higher-order logic programming. The former approach uses classical domain theoretic tools while the latter builds on a fixed-point construction defined on
Angelos Charalambidis +2 more
doaj +1 more source