Rankings
Publications
Search Publications
Cited-By Search
Sources
Publishers
Scholars
Scholars
Top Cited Scholars
Organizations
About
Login
Register
Home
Publications
The Complexity of Default Reasoning Under the Stationary Fixed Point Semantics
Home
Publications
The Complexity of Default Reasoning Under the Stationary Fixed Point Semantics
The Complexity of Default Reasoning Under the Stationary Fixed Point Semantics
G. Gottlob
G. Gottlob
Publisher Website
Google Scholar
Add to Library
Cite
Download
Share
Download
Download
Download PDF
Download
1 August 1995
journal article
Published by
Elsevier
in
Information and Computation
Vol. 121
(1)
,
81-92
https://doi.org/10.1006/inco.1995.1124
Abstract
No abstract available
Keywords
STATIONARY FIXED POINT SEMANTICS
DEFAULT REASONING
DECISION PROBLEM
DEFAULT LOGIC
FIXED POINT ITERATION
POLYNOMIAL TIME
COMPUTATIONAL COMPLEXITY
FIXED POINT
Cited by 12 articles