Proceedings Article, Paper
@InProceedings
Beitrag in Tagungsband, Workshop


Show entries of:

this year (2019) | last year (2018) | two years ago (2017) | Notes URL

Action:

login to update

Options:








Author, Editor

Author(s):

Eisinger, Norbert
Ohlbach, Hans Jürgen

dblp
dblp



Editor(s):

Gabbay, Dov M.
Hogger, C. J.
Robinson, J. A.

dblp
dblp
dblp



BibTeX cite key*:

EisingerOhlbach93

Title, Booktitle

Title*:

Deduction Systems Based on Resolution

Booktitle*:

Handbook of Logic in Artificial Intelligence and Logic Programming

Event, URLs

URL of the conference:


URL for downloading the paper:


Event Address*:

?

Language:

English

Event Date*
(no longer used):

?

Organization:


Event Start Date:

12 November 2019

Event End Date:

12 November 2019

Publisher

Name*:

Oxford University Press

URL:


Address*:

Oxford, UK

Type:


Vol, No, Year, pp.

Series:


Volume:

I, Logical Foundations

Number:


Month:


Pages:

184-271

Year*:

1993

VG Wort Pages:


ISBN/ISSN:

0-19-853745-X

Sequence Number:


DOI:




Note, Abstract, ©

Note:

Also available as Research Report MPI-I-91-217

(LaTeX) Abstract:

A general theory of deduction systems is presented. The theory is illustrated with deduction systems based on the resolution calculus, in particular with clause graphs. This theory distinguishes four constituents of a deduction system: \begin{itemize} \item the logic, which establishes a notion of semantic entailment; \item the calculus, whose rules of inference provide the syntactic counterpart of entailment; \item the logical state transition system, which determines the representation of formulae or sets of formulae together with their interrelationships, and also may allow additional operations reducing the search space; \item the control, which comprises the criteria used to choose the most promising from among all applicable inference steps. \end{itemize} Much of the standard material on resolution is presented in this framework. For the last two levels many alternatives are discussed. Appropriately adjusted notions of soundness, completeness, confluence, and Noetherianness are introduced in order to characterize the properties of particular deduction systems. For more complex deduction systems, where logical and topological phenomena interleave, such properties can be far from obvious.



Download
Access Level:


Correlation

MPG Unit:

Max-Planck-Institut für Informatik



MPG Subunit:

Programming Logics Group

Audience:

experts only

Appearance:



BibTeX Entry:

@INPROCEEDINGS{EisingerOhlbach93,
AUTHOR = {Eisinger, Norbert and Ohlbach, Hans J{\"u}rgen},
EDITOR = {Gabbay, Dov M. and Hogger, C. J. and Robinson, J. A.},
TITLE = {Deduction Systems Based on Resolution},
BOOKTITLE = {Handbook of Logic in Artificial Intelligence and Logic Programming},
PUBLISHER = {Oxford University Press},
YEAR = {1993},
VOLUME = {I, Logical Foundations},
PAGES = {184--271},
ADDRESS = {?},
ISBN = {0-19-853745-X},
}


Entry last modified by Christine Kiesel, 03/12/2010
Show details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)
Hide details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)

Editor(s)
Hans Jürgen Ohlbach
Created
02/06/1995 05:56:20 PM
Revisions
7.
6.
5.
4.
3.
Editor(s)
Christine Kiesel
Christine Kiesel
Uwe Brahm/MPII/DE
Hans Jürgen Ohlbach/AG2/MPII/DE
Hans Jürgen Ohlbach/AG2/MPII/DE
Edit Dates
28.08.2001 08:37:32
28.08.2001 08:36:51
10/02/95 17:19:42
31/01/95 15:25:56
31/01/95 15:22:41