Results 21 to 30 of about 140,069 (266)
On Recurrent Neural Network Based Theorem Prover For First Order Minimal Logic [PDF]
Journal of Universal Computer Science, 2021 There are three main problems for theorem proving with a standard cut-free system for the first order minimal logic. The first problem is the possibility of looping. Secondly, it might generate proofs which are permutations of each other. Finally, during
Ashot Baghdasaryan, Hovhannes Bolibekyan
doaj +3 more sources
Artificial Intelligence, 2017 Distributed First Order Logic (DFOL) has been introduced more than ten years ago with the purpose of formalising distributed knowledge-based systems, where knowledge about heterogeneous domains is scattered into a set of interconnected modules.
Chiara Ghidini, Luciano Serafini
openaire +3 more sources
Proceedings of the 8th conference of the European Society for Fuzzy Logic and Technology, 2013 This paper represents the third step in the development of EQ-logics. Namely, after developing propositional and higher-order EQ-logics, we focus also on predicate one. First, we give a brief overview of the propositional EQ-logic and then develop syntax and semantics of predicate EQ-logic.
Martin Dyba, Vilém Novák
openaire +1 more source
Finite Model Reasoning in Expressive Fragments of First-Order Logic [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 Over the past two decades several fragments of first-order logic have been identified and shown to have good computational and algorithmic properties, to a great extent as a result of appropriately describing the image of the standard translation of ...
Lidia Tendera
doaj +1 more source
Logic + probabilistic programming + causal laws
Royal Society Open Science, 2023 Probabilistic planning attempts to incorporate stochastic models directly into the planning process, which is the problem of synthesizing a sequence of actions that achieves some objective for a putative agent.
Vaishak Belle
doaj +1 more source
Inferences Between Buridan’s Modal Propositions
Problemos, 2022 In recent years modal syllogistic provided by 14th century logician John Buridan has attracted increasing attention of historians of medieval logic. The widespread use of quantified modal logic with the apparatus of possible worlds semantics in current ...
Jonas Dagys +2 more
doaj +1 more source
Computing with First-Order Logic
Journal of Computer and System Sciences, 1995 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Serge Abiteboul, Victor Vianu
openaire +2 more sources
Admissibility, compatibility, and deducibility in first-order sequent logics [PDF]
Computer Science Journal of Moldova, 2015 The paper is about the notions of admissibility and compatibility and their significance for deducibility in different sequent logics including first-order classical and intuitionistic ones both without and with equality and, possibly, with modal rules.
Alexander Lyaletski
doaj
Annals of Pure and Applied Logic, 2013 From a logical point of view, Stone duality for Boolean algebras relates theories in classical propositional logic and their collections of models. The theories can be seen as presentations of Boolean algebras, and the collections of models can be topologized in such a way that the theory can be recovered from its space of models.
Steven Awodey, Henrik Forssell
openaire +2 more sources
Annals of Pure and Applied Logic, 2007 First-order Goedel logics are a family of infinite-valued logics where the sets of truth values V are closed subsets of [0, 1] containing both 0 and 1. Different such sets V in general determine different Goedel logics G_V (sets of those formulas which evaluate to 1 in every interpretation into V). It is shown that G_V is axiomatizable iff V is finite,
Matthias Baaz +2 more
openaire +2 more sources