4617 search results - page 592 / 924 » Automation of Diagrammatic Reasoning |
252
click to vote
FLOPS
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. This paper describes how high level implementations of (needed) narrowing into Prolog can be improved by analysing definitional trees. First, we introduce a refined repre...
216
click to vote
CSL
2006
Springer
15 years 11 months ago
2006
Springer
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...
170
Voted
CSL
2006
Springer
15 years 11 months ago
2006
Springer
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...
194
click to vote
CSL
2006
Springer
15 years 11 months ago
2006
Springer
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...
219
click to vote
CSL
2006
Springer
15 years 11 months ago
2006
Springer
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...