Results 31 to 40 of about 1,698,712 (321)
Logic + probabilistic programming + causal laws
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
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,
Baaz, Matthias +2 more
openaire +2 more sources
Inferences Between Buridan’s Modal Propositions
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
First-order logic learning in artificial neural networks [PDF]
Artificial Neural Networks have previously been applied in neuro-symbolic learning to learn ground logic program rules. However, there are few results of learning relations using neuro-symbolic learning.
Broda, K., Garcez, A., Guillame-Bert, M.
core +1 more source
Representing First-Order Causal Theories by Logic Programs [PDF]
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
Admissibility, compatibility, and deducibility in first-order sequent logics [PDF]
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
A herbrandized functional interpretation of classical first-order logic [PDF]
We introduce a new typed combinatory calculus with a type constructor that, to each type σ, associates the star type σ^∗ of the nonempty finite subsets of elements of type σ.
Ferreira, Fernando, Ferreira, Gilda
core +1 more source
Learning Concepts Definable in First-Order Logic with Counting [PDF]
We study Boolean classification problems over relational background structures in the logical framework introduced by Grohe and Turán (TOCS 2004). It is known (Grohe and Ritzert, LICS 2017) that classifiers definable in first-order logic over structures ...
Steffen van Bergerem
doaj +1 more source
A note on the expressive power of linear orders [PDF]
This article shows that there exist two particular linear orders such that first-order logic with these two linear orders has the same expressive power as first-order logic with the Bit-predicate FO(Bit). As a corollary we obtain that there also exists a
Anuj Dawar, Kees Doets, Steven Lindell, +8 more
core +2 more sources
First order logic to set requirements for secure code execution
Currently the problem of information security during designing and exploiting the objects of critical information infrastructure is paid special attention to.
A. V. Kozachok
doaj +1 more source

