Sciweavers

4573 search results - page 550 / 915
» Automated Reasoning
Sort
View
CSL
2006
Springer
15 years 10 months ago
Logical Omniscience Via Proof Complexity
The Hintikka-style modal logic approach to knowledge has a well-known defect of logical omniscience, i.e., an unrealistic feature that an agent knows all logical consequences of he...
Sergei N. Artëmov, Roman Kuznets
CSL
2006
Springer
15 years 10 months ago
Algorithms for Omega-Regular Games with Imperfect Information,
We study observation-based strategies for two-player turn-based games on graphs with omega-regular objectives. An observation-based strategy relies on imperfect information about t...
Krishnendu Chatterjee, Laurent Doyen, Thomas A. He...
CSL
2006
Springer
15 years 10 months ago
Relating Two Standard Notions of Secrecy
Abstract. Two styles of definitions are usually considered to express that a security protocol preserves the confidentiality of a data s. Reachability-based secrecy means that s sh...
Véronique Cortier, Michaël Rusinowitch...
CSL
2006
Springer
15 years 10 months ago
A Sequent Calculus for Type Theory
Based on natural deduction, Pure Type Systems (PTS) can express a wide range of type theories. In order to express proof-search in such theories, we introduce the Pure Type Sequent...
Stéphane Lengrand, Roy Dyckhoff, James McKi...
CSL
2006
Springer
15 years 10 months ago
Visibly Pushdown Automata: From Language Equivalence to Simulation and Bisimulation
Abstract. We investigate the possibility of (bi)simulation-like preorder/equivalence checking on the class of visibly pushdown automata and its natural subclasses visibly BPA (Basi...
Jirí Srba