Results 31 to 40 of about 471,293 (319)
A belief revision approach for argumentation-based negotiation agents
International Journal of Applied Mathematics and Computer Science, 2015 Negotiation is an interaction that happens in multi-agent systems when agents have conflicting objectives and must look for an acceptable agreement. A typical negotiating situation involves two agents that cannot reach their goals by themselves because ...
Pilotti Pablo +2 more
doaj +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
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
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
The Journal of Logic Programming, 1994 Summary: CFT 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 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
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 +4 more sources
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