Results 21 to 30 of about 7,084,339 (219)
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
, 1998 We provide here a computational interpretation of first-order logic based on a constructive interpretation of satisfiability w.r.t. a fixed but arbitrary interpretation. In this approach the formulas themselves are programs.
Apt, Krzysztof R., Bezem, Marc
core +6 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
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
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 +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
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
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
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 +3 more sources