202 search results - page 31 / 41 » Proof Search in Minimal Logic |
LPAR
2004
Springer
14 years 27 days ago
2004
Springer
We propose a new parameter for the complexity of finite directed graphs which measures to what extent the cycles of the graph are intertwined. This measure, called entanglement, i...
CSFW
1999
IEEE
13 years 12 months ago
1999
IEEE
Most formal approaches to security protocol analysis are based on a set of assumptions commonly referred to as the "Dolev-Yao model." In this paper, we use a multiset re...
WWW
2008
ACM
14 years 8 months ago
2008
ACM
Current search mechanisms of DHT-based P2P systems can well handle a single keyword search problem. Other than single keyword search, multi-keyword search is quite popular and use...
DIAGRAMS
2008
Springer
13 years 9 months ago
2008
Springer
Diagrammatic logics have advantages over symbolic cousins. Peirce thought that logical diagrams (Existential Graphs, EG) are capable of "expression of all assertions", as...
ECCC
2007
13 years 7 months ago
2007
Satisfiability algorithms have become one of the most practical and successful approaches for solving a variety of real-world problems, including hardware verification, experime...