Sciweavers

193 search results - page 34 / 39
» Automated Reasoning in Kleene Algebra
Sort
View
TPHOL
2007
IEEE
15 years 6 months ago
HOL2P - A System of Classical Higher Order Logic with Second Order Polymorphism
Abstract. This paper introduces the logical system HOL2P that extends classical higher order logic (HOL) with type operator variables and universal types. HOL2P has explicit term o...
Norbert Völker
TIME
2005
IEEE
15 years 5 months ago
Exploiting the Relationship between IA Networks and Finite Domain CSPs
We exploit the fact that qualitative Interval Algebra (IA) network problems are finite domain CSPs. In the first part of the paper, we show how to convert a qualitative IA network ...
André Trudel, Haiyi Zhang
MCMASTER
1993
15 years 3 months ago
A Taste of Rewrite Systems
Abstract. This survey of the theory and applications of rewriting with equations discusses the existence and uniqueness of normal forms, the Knuth-Bendix completion procedure and i...
Nachum Dershowitz
JAR
2000
145views more  JAR 2000»
14 years 11 months ago
Logical Cryptanalysis as a SAT Problem
Cryptographic algorithms play a key role in computer security and the formal analysis of their robustness is of utmost importance. Yet, logic and automated reasoning tools are seld...
Fabio Massacci, Laura Marraro
KR
2004
Springer
15 years 5 months ago
Evidence and Belief
We discuss the representation of knowledge and of belief from the viewpoint of decision theory. While the Bayesian approach enjoys general-purpose applicability and axiomatic foun...
Itzhak Gilboa, David Schmeidler