Completeness and Incompleteness for Plausibility Logic

Author: Schlechta K.1

Source: Journal of Logic, Language and Information, Volume 5, Number 2, April 1996 , pp. 177-192(16)

Publisher: Springer

Key:
Free Content - Free Content
New Content - New Content
Subscribed Content - Subscribed Content
Free Trial Content - Free Trial Content

Abstract:

Plausibility Logic was introduced by Daniel Lehmann. We show - among some other results - completeness of a subset of Plausibility Logic for Preferential Models, and incompleteness of full Plausibility Logic for smooth Preferential Models.

Keywords: non-monotonic logic; preferential models; plausibility logic

Language: English

Document Type: Regular paper

Affiliations: 1: Laboratoire d'Informatique de Marseille, URA CNRS 1787, CMI, Technopôle de Château-Gombert, F-13453 Marseille Cedex, France (E-mail: ks@gyptis-univ-mrs.fr)

The full text electronic article is available for purchase. You will be able to download the full text electronic article after payment.

$47.00 plus tax      Refund Policy

 

OR

Back to top

Key:
Free Content - Free Content
New Content - New Content
Subscribed Content - Subscribed Content
Free Trial Content - Free Trial Content
Share this item with others: These icons link to social bookmarking sites where readers can share and discover new web pages.
Page Help Click here for Page Help
Shopping cart
Tools
Sign in






Need to register?
Sign up here
Text size: A | A | A | A