Sciweavers

4 search results - page 1 / 1
» Completeness for Flat Modal Fixpoint Logics
Sort
View
LPAR
2007
Springer
14 years 2 months ago
Completeness for Flat Modal Fixpoint Logics
Luigi Santocanale, Yde Venema
ICTL
1994
14 years 18 days ago
Completeness through Flatness in Two-Dimensional Temporal Logic
We introduce a temporal logic TAL and prove that it has several nice features. The formalism is a two-dimensional modal system in the sense that formulas of the language are evalua...
Yde Venema
LMCS
2007
132views more  LMCS 2007»
13 years 8 months ago
The Complexity of Model Checking Higher-Order Fixpoint Logic
Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed λ-calculus and the modal µ-calculus. This makes it a highly expressive temporal logic that is capable of express...
Roland Axelsson, Martin Lange, Rafal Somla
AAAI
1998
13 years 10 months ago
Fixpoint 3-Valued Semantics for Autoepistemic Logic
The paper presents a constructive 3-valued semantics for autoepistemic logic (AEL). We introduce a derivation operator and de ne the semantics as its least xpoint. The semantics is...
Marc Denecker, V. Wiktor Marek, Miroslaw Truszczyn...