Results 31 to 40 of about 7,040,431 (319)
Transition Systems for Model Generators - A Unifying Approach [PDF]
, 2011 A fundamental task for propositional logic is to compute models of propositional formulas. Programs developed for this task are called satisfiability solvers.
Denecker +11 more
core +4 more sources
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
Logic Programming as Constructivism [PDF]
, 1989 The features of logic programming that seem unconventional from the viewpoint of classical logic can be explained in terms of constructivistic logic. We motivate and propose a constructivistic proof theory of non-Horn logic programming.
Bry, François
core +1 more source
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
On Equivalence of Infinitary Formulas under the Stable Model Semantics [PDF]
, 2014 Propositional formulas that are equivalent in intuitionistic logic, or in its extension known as the logic of here-and-there, have the same stable models. We extend this theorem to propositional formulas with infinitely long conjunctions and disjunctions
Harrison, Amelia +2 more
core +1 more source
Model Checking Linear Logic Specifications [PDF]
, 2003 The overall goal of this paper is to investigate the theoretical foundations of algorithmic verification techniques for first order linear logic specifications.
Bozzano, M., Delzanno, G., Martelli, M.
core +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
Well–definedness and efficient inference for probabilistic logic programming under the distribution semantics [PDF]
Theory and Practice of Logic Programming, 2011 Distribution semantics is one of the most prominent approaches for the combination of logic programming and probability theory. Many languages follow this semantics, such as Independent Choice Logic, PRISM, pD, Logic Programs with Annotated Disjunctions (
Fabrizio Riguzzi, T. Swift
semanticscholar +1 more source
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