Skip to search formSkip to main contentSkip to account menu

First-order logic

Known as: First-order-logic, First-order predicate calculus, FOL 
First-order logic is a collection of formal systems used in mathematics, philosophy, linguistics, and computer science. It is also known as first… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
Attempto Controlled EnglishBIT predicateBernays–Schönfinkel classBounded quantifier

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2004
Highly Cited
2004
Empirical Low-Order Models of Barotropic Flow
Empirical low-order models are constructed in the framework of a quasigeostrophic barotropic spectral model, truncated at T21… 
2002
2002
Runtime Service Composition via Logic-Based Program Synthesis
Dynamic composition of services from components at runtime can help to provide flexible service infrastructures, but requires… 
Review
2001
Review
2001
New experimental techniques for magnetic anisotropy in molecular materials
Review
1995
Review
1995
Introduction to Finite Elements
This work assumes a basic familiarity with the finite element method. For those readers desiring a better understanding of the… 
Highly Cited
1992
Highly Cited
1992
A theoretical analysis of reasoning by symmetry in first-order logic (extended abstract)
Many classes of reasoning problems display a large amount of symmetry. In mathematical and common-sense reasoning, such… 
1991
1991
How to Prove Higher Order Theorems in First Order Logic
In this paper we are interested in using a first order theorem prover to prove theorems that are formulated in some higher order… 
Highly Cited
1987
Highly Cited
1987
Specification statements and refinements
We discuss the development of executable programs from state-based specifications written in the language of first-order… 
Highly Cited
1986
Highly Cited
1986
Gauge Covariant Local Formulation of Free Strings and Superstrings
1979
1979
First order programming logic
First Order Programming Logic is a simple, yet powerful formal system for reasoning about recursive programs. In its simplest… 
1977
1977
A Network-Based Knowledge Representation and Its Natural Deduction System
We describe a knowledge representation scheme called KNET and a problem solving system called SNIFFER designed to answer queries… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)