Sciweavers

4573 search results - page 522 / 915
» Automated Reasoning
Sort
View
171
Voted
LOGCOM
2008
81views more  LOGCOM 2008»
15 years 4 months ago
The Semantic Processing of Continuous Quantities for Discrete Terms in Ontologies
We consider continuous quantities that are used to describe the physical world, such as colour, shape, sound, texture, and spatial and temporal arrangements. Natural languages are...
Shenghui Wang, David E. Rydeheard, Jeff Z. Pan
LICS
2006
IEEE
15 years 11 months ago
Provable Implementations of Security Protocols
for reasoning about abstract models of protocols. The work on informal methods attempts to discern common patterns in the extensive record of flawed protocols, and to formulate po...
Andrew D. Gordon
CADE
2005
Springer
16 years 5 months ago
Nominal Techniques in Isabelle/HOL
Abstract This paper describes a formalisation of the lambda-calculus in a HOL-based theorem prover using nominal techniques. Central to the formalisation is an inductive set that i...
Christian Urban, Christine Tasson
ICCBR
2009
Springer
15 years 11 months ago
Improving Reinforcement Learning by Using Case Based Heuristics
This work presents a new approach that allows the use of cases in a case base as heuristics to speed up Reinforcement Learning algorithms, combining Case Based Reasoning (CBR) and ...
Reinaldo A. C. Bianchi, Raquel Ros, Ramon Ló...
132
Voted
CSL
2005
Springer
15 years 10 months ago
A Propositional Proof System for Log Space
The proof system G∗ 0 of the quantified propositional calculus corresponds to NC1 , and G∗ 1 corresponds to P, but no formula-based proof system that corresponds log space rea...
Steven Perron