KWTR: first-order logic

From semanticweb.org

Jump to:navigation, search

[edit] Contributors:

Jos de Bruijn, FUB

Please add your CV in the list of contributors


First-order logic is a well established formalism, and is the basis for many other subfields such as Description Logics and logic programming.

  Name of the institutions:
  Industry / sector: 
  Business activities improved by the SW solutions: 
  Research Needs: 
  Name of the project:
  Tools and applications implemented in the project:

Name: 
Website: 
Main characteristics:  
Open problems: 


Reference:  Melvin Fitting. First Order Logic and Automated Theorem Proving 
(second edition). Springer Verlag, 1996.
Short abstract: This graduate-level text presents fundamental concepts and   
results of classical logic in a rigorous mathematical style. Applications to  
automated theorem proving are considered and usable Prolog programs provided. It 
will serve both as a first text in formal logic and an introduction to automation 
issues for students in computer science or mathematics. The book treats 
propositional logic, first-order logic, and first-order logic with equality. In 
each case the initial presentation is semantic, to define the intended subjects 
independently of the choice of proof mechanism. Then many kinds of proof 
procedure are introduced. Results such as completeness, compactness, and 
interpolation are established, and theorem provers are implemented in Prolog. 
This new edition includes material on AE calculus, Herbrand's Theorem, Gentzen's  
Theorem, and related topics.
Reference:  Chin-Liang Chang. Symbolic Logic and Mechanical Theorem Proving. 
Academic Press, 1973.
Short abstract:Mechanical theorem proving is an important subject in 
artificial intelligence. It has been applied to many areas--program analysis, 
program synthesis, deductive question-answering systems, problem-solving systems, 
and robot technology. This classic text provides a thorough discussion of 
mechanical theorem proving and its applications as well as an introduction to 
symbolic logic. A purely model-theoretic approach to first-order logic is 
adopted, and the book emphasizes efficient computer implementations of proof 
techniques. 
Reference: J. Alan Robinson and Andrei Voronkov (eds). Handbook of Automated 
Reasoning. MIT press, 2001. 
Short abstract: Automated reasoning has matured into one of the most 
advanced areas of computer science. It is used in many areas of the field, 
including software and hardware verification, logic and functional programming, 
formal methods, knowledge representation, deductive databases, and artificial 
intelligence. This handbook presents an overview of the fundamental ideas, 
techniques, and methods in automated reasoning and its applications. The material 
covers both theory and implementation. In addition to traditional topics, the 
book covers material that bridges the gap between automated reasoning and related 
areas. Examples include model checking, nonmonotonic reasoning, numerical 
constraints, description logics, and implementation of declarative programming 
languages. 

First-order logic is a well established formalism, and is the basis for many other subfields such as Description Logics and logic programming.

Name of the project: 
Type: 
Duration: 
Partners: 
Research Institution: 
Industrial Partners: 
Core activities: 
Market opportunities: 
Problems and missing tools: 
Problems – Semantic Web culture is missing: 

Common Logic is an effort to standardize a syntax for (variants of) first-order logic.

The Process Specification Language is an ISO standard language for specifying processes, e.g. Semantic Web services, specified as a set of first-order logic axioms in common logic.

Topics: 
Reason: 
References: none


The state-of-the-art first-order theorem prover [Vampire http://reliant.teknowledge.com/cgi-bin/cvsweb.cgi/Vampire/] has been used for reasoning with SWRL:

Ian Horrocks, Peter F. Patel-Schneider, Sean Bechhofer, Dmitry Tsarkov: OWL rules: A proposal and prototype implementation. J. Web Sem. 3(1): 23-40 (2005)

Name: Vampire
Website: http://reliant.teknowledge.com/cgi-bin/cvsweb.cgi/Vampire/
Description: see the web page 
References: Alexandre Riazanov, Andrei Voronkov: The design and implementation of 
                  VAMPIRE. AI Commun. 15(2-3): 91-110 (2002)
Main features: State-of-the-art theorem prover
Open problems: Theorem proving with subsets of first-order logic


Navigation
services
Toolbox