You are viewing a javascript disabled version of the site. Please enable Javascript for this site to function properly.
Go to headerGo to navigationGo to searchGo to contentsGo to footer
In content section. Select this link to jump to navigation

Negation as Failure to Prove and Fixed Points

Article type: Research Article

Authors: Marek, W.; *; ** | Truszczynski, M.; **

Affiliations: Department of Computer Science, University of Kentucky, Lexington, KY 40506-0027

Note: [*] Partially supported by USDA grant USDA/CSRS/84-CSRS-2-2524.

Note: [**] Partially supported by NSF RU-8610671 grant, and Commonwealth of Kentucky through Kentucky EPSCoR program.

Abstract: We investigate solutions of fixed point equations related to the negation as “failure to prove” rule, and show their relevance to minimal models.

Keywords: Closed World Assumption, negation as failure to prove, logic, fixed points

DOI: 10.3233/FI-1989-12210

Journal: Fundamenta Informaticae, vol. 12, no. 2, pp. 255-267, 1989

Received September 1988
|
Accepted October 1988
|
Published: 1 April 1989
Price: EUR 27.50
Show more