Sciweavers

1020 search results - page 112 / 204
» Tight Semantics for Logic Programs
Sort
View
DKE
2008
114views more  DKE 2008»
14 years 12 months ago
Proof explanation for a nonmonotonic Semantic Web rules language
In this work, we present the design and implementation of a system for proof explanation in the Semantic Web, based on defeasible reasoning. Trust is a vital feature for Semantic ...
Grigoris Antoniou, Antonis Bikakis, Nikos Dimaresi...
ACTA
1998
81views more  ACTA 1998»
14 years 11 months ago
Dijkstra-Scholten Predicate Calculus: Concepts and Misconceptions
The paper focusses on the logical backgrounds of the Dijkstra-Scholten program development style for correct programs. For proving the correctness of a program (i.e. the fact that...
Lex Bijlsma, Rob Nederpelt
SDMW
2004
Springer
15 years 5 months ago
PeerTrust: Automated Trust Negotiation for Peers on the Semantic Web
Abstract. Researchers have recently begun to develop and investigate policy languages to describe trust and security requirements on the Semantic Web. Such policies will be one com...
Wolfgang Nejdl, Daniel Olmedilla, Marianne Winslet...
NAACL
2007
15 years 1 months ago
Exploiting Event Semantics to Parse the Rhetorical Structure of Natural Language Text
Previous work on discourse parsing has mostly relied on surface syntactic and lexical features; the use of semantics is limited to shallow semantics. The goal of this thesis is to...
Rajen Subba
ICALP
2004
Springer
15 years 5 months ago
A Categorical Model for the Geometry of Interaction
We consider the multiplicative and exponential fragment of linear logic (MELL) and give a Geometry of Interaction (GoI) semantics for it based on unique decomposition categories. ...
Esfandiar Haghverdi, Philip J. Scott