232 search results - page 9 / 47 » Completeness and Decidability in Sequence Logic |
CSFW
1999
IEEE
15 years 1 months ago
1999
IEEE
Belief-logic deductions are used in the analysis of cryptographic protocols. We show a new method to decide such logics. In addition to the familiar BAN logic, it is also applicab...
APAL
2006
14 years 9 months ago
2006
A new modal logic D is introduced. It describes properties of provability by interpreting modality as a deductive closure operator on sets of formulas. Logic D is proven to be dec...
DEXA
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. Workflow Management Systems (WFMS) coordinate execution of logically related multiple tasks in an organization. A workflow schema is defined using a set of tasks that are...
CADE
2006
Springer
15 years 1 months ago
2006
Springer
We present a tool for checking the sufficient completeness of linear, order-sorted equational specifications modulo associativity, commutativity, and identity. Our tool treats this...
115
click to vote
CADE
2005
Springer
15 years 9 months ago
2005
Springer
Two kinds of orderings are widely used in term rewriting and theorem proving, namely recursive path ordering (RPO) and Knuth-Bendix ordering (KBO). They provide powerful tools to p...