Sciweavers

343 search results - page 6 / 69
» Complete Axiomatizations for Reasoning About Knowledge and T...
Sort
View
TIME
1994
IEEE
14 years 20 days ago
An Algebraic Formulation of Temporal Knowledge for Reasoning about Recurring Events
We formulate an algebra of binary temporal relations between events the number of occurrences of which is unknown, but which are known to recur in time. Ontologically, we view the...
Robert A. Morris, William D. Shoaff, Lina Khatib
BIRTHDAY
2003
Springer
14 years 1 months ago
A Hierarchical Completeness Proof for Propositional Temporal Logic
Abstract. We present a new proof of axiomatic completeness for Proposition Temporal Logic (PTL) for discrete, linear time for both finite and infinite time (without past-time). T...
Ben C. Moszkowski
ATAL
2005
Springer
14 years 2 months ago
A computationally grounded logic of knowledge, belief and certainty
This paper presents a logic of knowledge, belief and certainty, which allows us to explicitly express the knowledge, belief and certainty of an agent. A computationally grounded m...
Kaile Su, Abdul Sattar, Guido Governatori, Qinglia...
AAAI
2011
12 years 8 months ago
Reasoning About General Games Described in GDL-II
Recently the general Game Description Language (GDL) has been extended so as to cover arbitrary games with incomplete/imperfect information. Learning—without human intervention...
Stephan Schiffel, Michael Thielscher
ENTCS
2007
98views more  ENTCS 2007»
13 years 8 months ago
A Completeness Proof for Bisimulation in the pi-calculus Using Isabelle
We use the interactive theorem prover Isabelle to prove that the algebraic axiomatization of bisimulation equivalence in the pi-calculus is sound and complete. This is the first ...
Jesper Bengtson, Joachim Parrow