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:




Library Locked Library locked




Author, Editor

Author(s):

Weidenbach, Christoph

dblp



Editor(s):

Bajcsy, R.

dblp



BibTeX cite key*:

Weidenbach93a

Title, Booktitle

Title*:

Extending the Resolution Method with Sorts

Booktitle*:

Proceedings of the 13th International Joint Conference on Artificial Intelligence (IJCAI '93)

Event, URLs

URL of the conference:


URL for downloading the paper:


Event Address*:

Chambery, France

Language:

English

Event Date*
(no longer used):


Organization:


Event Start Date:

18 September 2019

Event End Date:

18 September 2019

Publisher

Name*:

Morgan Kaufmann

URL:


Address*:

San Mateo, CA

Type:


Vol, No, Year, pp.

Series:


Volume:

1

Number:


Month:


Pages:

60-65

Year*:

1993

VG Wort Pages:


ISBN/ISSN:


Sequence Number:


DOI:




Note, Abstract, ©

(LaTeX) Abstract:

In this paper I extend the standard first-order resolution method with special reasoning mechanisms for sorts. Sorts are one place predicates. Literals built from one place predicates are called sort literals. Negative sort literals can be compiled into restrictions of the relevant variables to sorts or can be deleted if they fulfill special conditions. Positive sort literals define the sort structure for sorted unification. Sorted unification exploits the sort restrictions of variables. As the occurrence of sort literals is not restricted, it might be necessary to add additional literals to resolvents and factors and to dynamically change the set of positive sort literals used by sorted unification during the deduction process. The calculus I propose thus extends the standard resolution method by sorted unification, residue literals and a dynamic processing of the sort information. I show that this calculus generalizes and improves existing approaches to sorted reasoning. Finally I give some applications to automated theorem proving and abduction.



Download
Access Level:


Correlation

MPG Unit:




MPG Subunit:


Audience:

experts only

Appearance:

, CCL bibliography



BibTeX Entry:

@INPROCEEDINGS{Weidenbach93a,
AUTHOR = {Weidenbach, Christoph},
EDITOR = {Bajcsy, R.},
TITLE = {Extending the Resolution Method with Sorts},
BOOKTITLE = {Proceedings of the 13th International Joint Conference on Artificial Intelligence (IJCAI '93)},
PUBLISHER = {Morgan Kaufmann},
YEAR = {1993},
VOLUME = {1},
PAGES = {60--65},
ADDRESS = {Chambery, France},
}


Entry last modified by Uwe Brahm/MPII/DE, 07/31/2014
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)
[Library]
Created
05/12/2006 04:46:38 PM
Revisions
4.
3.
2.
1.
0.
Editor(s)
Uwe Brahm/MPII/DE
Uwe Brahm/MPII/DE
Uwe Brahm/MPII/DE
Uwe Brahm/MPII/DE
Uwe Brahm/MPII/DE
Edit Dates
13/02/95 11:55:25
21/01/95 20:57:18
17/01/95 20:42:22
15/01/95 16:25:41
14/01/95 19:00:53