Results 11 to 20 of about 1,546,334 (124)
The First-Order Hypothetical Logic of Proofs [PDF]
, 2018 The Propositional Logic of Proofs (LP) is a modal logic in which the modality □A is revisited as [[t]]A , t being an expression that bears witness to the validity of A .
Bonelli, Eduardo Augusto +1 more
core +1 more source
First-order logic learning in artificial neural networks [PDF]
, 2010 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
The First-Order Logic of CZF is Intuitionistic First-Order Logic [PDF]
We prove that the first-order logic of CZF is intuitionistic first-order logic. To do so, we introduce a new model of transfinite computation (Set Register Machines) and combine the resulting notion of realisability with Beth semantics.
Passmann, R.
core +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
, 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.
Ghidini, Chiara, Serafini, Luciano
core +1 more source
Fragments of first-order logic over infinite words [PDF]
, 2008 We give topological and algebraic characterizations as well as language theoretic descriptions of the following subclasses of first-order logic FO[
Diekert, Volker, Kufleitner, Manfred
core +6 more sources
Some Turing-Complete Extensions of First-Order Logic [PDF]
, 2014 We introduce a natural Turing-complete extension of first-order logic FO. The extension adds two novel features to FO. The first one of these is the capacity to add new points to models and new tuples to relations.
Kuusisto, Antti
core +2 more sources
A herbrandized functional interpretation of classical first-order logic [PDF]
, 2017 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
Finite-Degree Predicates and Two-Variable First-Order Logic [PDF]
, 2015 We consider two-variable first-order logic on finite words with a fixed number of quantifier alternations. We show that all languages with a neutral letter definable using the order and finite-degree predicates are also definable with the order predicate
Paperman, Charles
core +3 more sources
Datalog vs first-order logic [PDF]
, 1994 Our main result is that every datalog query expressible in first-order logic is bounded; in terms of classical model theory it is a kind of compactness theorem for finite structures.
Ajtai, Miklos, Gurevich, Yuri
core +1 more source