Results 31 to 40 of about 575,998 (339)
A Fuzzy Logic Programming Environment for Managing Similarity and Truth Degrees [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 FASILL (acronym of "Fuzzy Aggregators and Similarity Into a Logic Language") is a fuzzy logic programming language with implicit/explicit truth degree annotations, a great variety of connectives and unification by similarity.
Pascual Julián-Iranzo +3 more
doaj +1 more source
Advanced Engineering Research, 2021 Introduction. The organization of branches and repetitions in the context of logical programming is considered by an example of the Prolog language. The fundamental feature of the program in a logical programming language is the fact that a computer must
D. V. Zdor
doaj +1 more source
From Logic to Functional Logic Programs [PDF]
arXiv, 2022 Logic programming is a flexible programming paradigm due to the use of predicates without a fixed data flow. To extend logic languages with the compact notation of functional programming, there are various proposals to map evaluable functions into predicates in order to stay in the logic programming framework.
arxiv
Automated Termination Analysis for Logic Programs with Cut [PDF]
Theory and Practice of Logic Programming, 10(4-6), 365-381, 2010, 2010 Termination is an important and well-studied property for logic programs. However, almost all approaches for automated termination analysis focus on definite logic programs, whereas real-world Prolog programs typically use the cut operator. We introduce a novel pre-processing method which automatically transforms Prolog programs into logic programs ...
arxiv +1 more source
Representing First-Order Causal Theories by Logic Programs [PDF]
, 2011 Nonmonotonic causal logic, introduced by Norman McCain and Hudson Turner, became a basis for the semantics of several expressive action languages. McCain's embedding of definite propositional causal theories into logic programming paved the way to the ...
Armando +18 more
core +7 more sources
Structural Resolution for Abstract Compilation of Object-Oriented Languages [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 We propose abstract compilation for precise static type analysis of object-oriented languages based on coinductive logic programming. Source code is translated to a logic program, then type-checking and inference problems amount to queries to be solved ...
Luca Franceschini +2 more
doaj +1 more source
The Journal of Logic Programming, 1994 AbstractCFT is a new constraint system providing records as logical data structure for constraint (logic) programming. It can be seen as a generalization of the rational tree system employed in Prolog II, where finer-grained constraints are used and where subtrees are identified by keywords rather than by position.
Smolka, Gert, Treinen, Ralf
openaire +2 more sources
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
Logic programs as specifications in the inductive verification of logic programs
Electronic Notes in Theoretical Computer Science, 2001 AbstractIn this paper we define a new verification method based on an assertion language able to express properties defined by the user through a logic program. We first apply the verification framework defined in [3] to derive sufficient inductive conditions to prove partial correctness.
Comini M, GORI, ROBERTA, Levi G.
openaire +4 more sources
The Journal of Logic Programming, 1994 AbstractThis paper presents an overview and a survey of logic program synthesis. Logic program synthesis is interpreted here in a broad way; it is concerned with the following question: given a specification, how do we get a logic program satisfying the specification?
Deville, Yves, Lau, KK.
openaire +3 more sources