First-Order Logic
By Peter A. Flach. Encyclopedia of Machine Learning and Data Mining, 2017
430 citations recorded by the source corpus.
Subfields: Experimental and Cognitive Psychology, Theoretical Computer Science, Philosophy
View Paper: https://www.semanticscholar.org/paper/089ceea1f935df43b5ea403e7b89173d83a39fde
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Experimental and Cognitive Psychology
In Theoretical Computer Science
In Philosophy
Citations in the corpus
- Lifted Relational Neural Networks: Efficient Learning of Latent Relational Structures (2018, methodology): “We consider a function-free first-order logic, in which formulas are formed in the usual way from a set of constants, a set of variables, a set of n -ary predicates for each n ∈ N , and the propositional connectives ∨ , ∧ and ¬ (Smullyan, 1995).”
- A Natural Proof System for Natural Language (2017, methodology): “Some of the above mentioned properties have their proper names in the literature after Smullyan (1968).”