Completeness and Incompleteness for Plausibility Logic

Author: Schlechta K.

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

Publisher: Springer

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)

Publication date: 1996-04-01

• In this: publication
• By this: publisher
• In this Subject: Computer Science ,  Language & Linguistics ,  Philosophy
• By this author: Schlechta K.

Website © Publishing Technology. Article copyright remains with the publisher, society or author(s) as specified within the article.

• Terms and conditions
• Privacy policy
• Information for advertisers