Sciweavers

1941 search results - page 140 / 389
» Reasoning about Computations Using Two-Levels of Logic
Sort
View
AMW
2011
14 years 7 months ago
A Direct Translation from XPath to Nondeterministic Automata
Since navigational aspects of XPath correspond to first-order definability, it has been proposed to use the analogy with the very successful technique of translating LTL into aut...
Nadime Francis, Claire David, Leonid Libkin
LREC
2008
133views Education» more  LREC 2008»
15 years 4 months ago
Acquiring Naturalistic Concept Descriptions from the Web
Many of the beliefs that one uses to reason about everyday entities and events are neither strictly true or even logically consistent. Rather, people appear to rely on a large bod...
Tony Veale, Yanfen Hao
CORR
2010
Springer
96views Education» more  CORR 2010»
15 years 25 days ago
A Simple Correctness Proof for Magic Transformation
The paper presents a simple and concise proof of correctness of the magic transformation. We believe it may provide a useful example of formal reasoning about logic programs. The ...
Wlodzimierz Drabent
152
Voted
CLIMA
2006
15 years 4 months ago
Multi-Agent FLUX for the Gold Mining Domain (System Description)
FLUX is a declarative, CLP-based programming method for the design of agents that reason logically about their actions and sensor information in the presence of incomplete knowledg...
Stephan Schiffel, Michael Thielscher
155
Voted
IFM
2009
Springer
183views Formal Methods» more  IFM 2009»
15 years 1 months ago
Challenges in the Specification of Full Contracts
Abstract. The complete specification of full contracts -- contracts which include tolerated exceptions, and which enable reasoning about the contracts themselves, can be achieved u...
Gordon J. Pace, Gerardo Schneider