LPC(ID): A Sequent Calculus Proof System for Propositional Logic Extended with Inductive Definitions

07/11/2012
by   Ping Hou, et al.
0

The logic FO(ID) uses ideas from the field of logic programming to extend first order logic with non-monotone inductive definitions. Such logic formally extends logic programming, abductive logic programming and datalog, and thus formalizes the view on these formalisms as logics of (generalized) inductive definitions. The goal of this paper is to study a deductive inference method for PC(ID), which is the propositional fragment of FO(ID). We introduce a formal proof system based on the sequent calculus (Gentzen-style deductive system) for this logic. As PC(ID) is an integration of classical propositional logic and propositional inductive definitions, our sequent calculus proof system integrates inference rules for propositional calculus and definitions. We present the soundness and completeness of this proof system with respect to a slightly restricted fragment of PC(ID). We also provide some complexity results for PC(ID). By developing the proof system for PC(ID), it helps us to enhance the understanding of proof-theoretic foundations of FO(ID), and therefore to investigate useful proof systems for FO(ID).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/31/2020

Proof search for full intuitionistic propositional logic through a coinductive approach for polarized logic

The approach to proof search dubbed "coinductive proof search", and prev...
research
10/09/2019

A Query-Driven Decision Procedure for Distributed Autoepistemic Logic with Inductive Definitions

Distributed Autoepistemic Logic with Inductive Definitions (dAEL(ID)) is...
research
01/16/2014

Grounding FO and FO(ID) with Bounds

Grounding is the task of reducing a first-order theory and finite domain...
research
03/08/2000

SLDNFA-system

The SLDNFA-system results from the LP+ project at the K.U.Leuven, which ...
research
03/07/2000

Extending Classical Logic with Inductive Definitions

The goal of this paper is to extend classical logic with a generalized n...
research
08/13/2021

Natural Deduction Calculus for First-Order Logic

The purpose of this paper is to give an easy to understand with step-by-...
research
01/08/2013

Extending FO(ID) with Knowledge Producing Definitions: Preliminary Results

Previous research into the relation between ASP and classical logic has ...

Please sign up or login with your details

Forgot password? Click here to reset