JAR
2006
13 years 11 months ago
2006
In many AI fields, the problem of finding out a solution which is as close as possible to a given configuration has to be faced. This paper addresses this problem in a propositiona...
JAR
2006
13 years 11 months ago
2006
The dependency pair technique [1, 11, 12] is a powerful method for automated termination and innermost termination proofs of term rewrite systems (TRSs). For any TRS, it generates ...
JAR
2006
13 years 11 months ago
2006
SET (Secure Electronic Transaction) is a suite of protocols proposed by a consortium of credit card companies and software corporations to secure ecommerce transactions. The Purcha...
JAR
2006
13 years 11 months ago
2006
Otter-lambda is Otter modified by adding code to implement an algorithm for lambda unification. Otter is a resolution-based, clause-language first-order prover that accumulates de...
JAR
2006
13 years 11 months ago
2006
We use some recent techniques from process algebra to draw several conclusions about the well studied class of ping-pong protocols introduced by Dolev and Yao. In particular we sho...
JAR
2006
13 years 11 months ago
2006
Answer Set Programming (ASP) emerged in the late 1990s as a new logic programming paradigm which has been successfully applied in various application domains. Also motivated by the...
JAR
2006
13 years 11 months ago
2006
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
JAR
2006
13 years 11 months ago
2006
To simplify the task of proving termination and AC-termination of term rewriting systems, elimination transformations have been vigorously studied since the 1990's. Dummy elim...
JAR
2006
13 years 11 months ago
2006
Automated tools for finding attacks on flawed security protocols often fail to quately with group protocols. This is because the abstractions made to improve performance on fixed ...
JAR
2006
13 years 11 months ago
2006
Using automated reasoning techniques, we tackle the niche activity of proving that a program is free from run-time exceptions. Such a property is particularly valuable in high inte...