Sciweavers

3658 search results - page 237 / 732
» The logic of proofs, semantically
Sort
View
RTA
2004
Springer
16 years 1 days ago
TORPA: Termination of Rewriting Proved Automatically
Abstract. In this paper it is described how a combination of polynomial interpretations, recursive path order, RFC match-bounds, the dependency pair method and semantic labelling c...
Hans Zantema
FM
2006
Springer
134views Formal Methods» more  FM 2006»
15 years 10 months ago
Formal Verification of a C Compiler Front-End
This paper presents the formal verification of a compiler front-end that translates a subset of the C language into the Cminor intermediate language. The semantics of the source an...
Sandrine Blazy, Zaynah Dargaye, Xavier Leroy
ECSQARU
2007
Springer
16 years 26 days ago
Extending Description Logics with Uncertainty Reasoning in Possibilistic Logic
Possibilistic logic provides a convenient tool for dealing with inconsistency and handling uncertainty. In this paper, we propose possibilistic description logics as an extension o...
Guilin Qi, Jeff Z. Pan, Qiu Ji
ICDE
2008
IEEE
165views Database» more  ICDE 2008»
16 years 1 months ago
Semantic Web and firewall alignment
— Secure Semantic Web applications, particularly those involving access control, are typically focused at the application-domain only, rather than taking a more holistic approach...
Simon N. Foley, William M. Fitzgerald
ECSQARU
2009
Springer
16 years 1 months ago
Realizing Default Logic over Description Logic Knowledge Bases
Abstract. We consider a realization of Reiter-style default logic on top of description logic knowledge bases (DL-KBs). To this end, we present elegant transformations from default...
Minh Dao-Tran, Thomas Eiter, Thomas Krennwallner