Results 11 to 20 of about 482,181 (288)
2P-Kt: A logic-based ecosystem for symbolic AI
SoftwareX, 2021 To date, logic-based technologies are either built on top or as extensions of the Prolog language, mostly working as monolithic solutions tailored upon specific inference procedures, unification mechanisms, or knowledge representation techniques. Instead,
Giovanni Ciatto +2 more
doaj +1 more source
PENGENALAN LOGIKA MEMBUAT PROGRAM GAME PADA ANAK-ANAK DENGAN MENGGUNAKAN APLIKASI SCRATCH
Pena Dimas, 2023 Gaming is currently a game that both children and adults are very interested in. If not anticipated as early as possible, these games can become addictive or dependent.
Muhammad Sholeh +2 more
doaj +1 more source
Logic programming and constraint logic programming [PDF]
ACM Computing Surveys, 1996 Logic programming is a language paradigm based on logic, more specifically on resolution theorem proving in the predicate calculus as proposed in Robinson [1965]. Robinson had the foresight to distinguish the importance of two components in automatic theorem proving: a single inference rule called resolution and the testing for equality of trees called
openaire +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
The CIFF Proof Procedure for Abductive Logic Programming with Constraints: Theory, Implementation and Experiments [PDF]
, 2009 We present the CIFF proof procedure for abductive logic programming with constraints, and we prove its correctness. CIFF is an extension of the IFF proof procedure for abductive logic programming, relaxing the original restrictions over variable ...
Endriss, U. +4 more
core +2 more sources
, 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
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
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
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