Sciweavers

213 search results - page 37 / 43
» A framework for checking proofs naturally
Sort
View
20
Voted
KR
2000
Springer
13 years 11 months ago
A Logic Based Language for Parametric Inheritance
Though overriding as a single and default mode of inheritance is adequate for most knowledge bases, a large class of applications naturally requires several inheritance modes and ...
Hasan M. Jamil
CORR
2010
Springer
131views Education» more  CORR 2010»
13 years 6 months ago
Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding
: We develop a framework for solving polynomial equations with size constraints on solutions. We obtain our results by showing how to apply a technique of Coppersmith for finding ...
Henry Cohn, Nadia Heninger
VMCAI
2010
Springer
14 years 4 months ago
Temporal Reasoning for Procedural Programs
While temporal verification of programs is a topic with a long history, its traditional basis--semantics based on word languages--is illsuited for modular reasoning about procedura...
Rajeev Alur, Swarat Chaudhuri
GOSLER
1995
13 years 11 months ago
A Guided Tour Across the Boundaries of Learning Recursive Languages
The present paper deals with the learnability of indexed families of uniformly recursive languages from positive data as well as from both, positive and negative data. We consider...
Thomas Zeugmann, Steffen Lange
IEEESCC
2006
IEEE
14 years 1 months ago
Multiagent Policy Architecture for Virtual Business Organizations
A virtual organization (VO) is a dynamic collection of entities (individuals, enterprises, and information resources) collaborating on some computational activity. VOs are an emer...
Yathiraj B. Udupi, Munindar P. Singh