Sciweavers

802 search results - page 137 / 161
» On the formal semantics of IF-like logics
Sort
View
POPL
2011
ACM
12 years 12 months ago
Making prophecies with decision predicates
We describe a new algorithm for proving temporal properties expressed in LTL of infinite-state programs. Our approach takes advantage of the fact that LTL properties can often be...
Byron Cook, Eric Koskinen
MPC
2010
Springer
246views Mathematics» more  MPC 2010»
13 years 11 months ago
Abstraction of Object Graphs in Program Verification
ion of Object Graphs in Program Verification Yifeng Chen1 and J.W. Sanders2 1 HCST Key Lab at School of EECS, Peking University, China. 2 UNU-IIST, Macao. A set-theoretic formalism...
Yifeng Chen, Jeff W. Sanders
ERSHOV
2009
Springer
14 years 3 months ago
Towards a Scalable, Pragmatic Knowledge Representation Language for the Web
Abstract. A basic cornerstone of the Semantic Web are formal languages for describing resources in a clear and unambiguous way. Logical underpinnings facilitate automated reasoning...
Florian Fischer, Gulay Ünel, Barry Bishop, Di...
WWW
2007
ACM
14 years 9 months ago
Towards Deeper Understanding of the Search Interfaces of the Deep Web
Many databases have become Web-accessible through form-based search interfaces (i.e., HTML forms) that allow users to specify complex and precise queries to access the underlying ...
Hai He, Weiyi Meng, Yiyao Lu, Clement T. Yu, Zongh...
WWW
2007
ACM
14 years 9 months ago
Just the right amount: extracting modules from ontologies
The ability to extract meaningful fragments from an ontology is key for ontology re-use. We propose a definition of a module that guarantees to completely capture the meaning of a...
Bernardo Cuenca Grau, Ian Horrocks, Yevgeny Kazako...