Sciweavers

30 search results - page 6 / 6
» SLT-Resolution for the Well-Founded Semantics
Sort
View
RR
2007
Springer
14 years 4 months ago
A Semantic Framework for Language Layering in WSML
Abstract. WSML presents a framework encompassing different language variants, rooted in Description Logics and (F-)Logic Programming. So far, the precise relationships between thes...
Jos de Bruijn, Stijn Heymans
ICLP
2010
Springer
14 years 2 months ago
Tight Semantics for Logic Programs
We define the Tight Semantics (TS), a new semantics for all NLPs complying with the requirements of: 2-valued semantics; preserving the models of SM; guarantee of model existence...
Luís Moniz Pereira, Alexandre Miguel Pinto
IFIP
2004
Springer
14 years 4 months ago
A Formal Approach to Specify and Deploy a Network Security Policy
Current firewall configuration languages have no well founded semantics. Each firewall implements its own algorithm that parses specific proprietary languages. The main conseq...
Frédéric Cuppens, Nora Cuppens-Boula...
WWW
2008
ACM
14 years 11 months ago
Networked graphs: a declarative mechanism for SPARQL rules, SPARQL views and RDF data integration on the web
Easy reuse and integration of declaratively described information in a distributed setting is one of the main motivations for building the Semantic Web. Despite of this claim, reu...
Simon Schenk, Steffen Staab
ICLP
2009
Springer
14 years 11 months ago
Incremental Answer Completion in the SLG-WAM
The SLG-WAM of XSB Prolog soundly implements the Well-Founded Semantics (WFS) for logic programs, but in a few pathological cases its engine treats atoms as undefined that are true...
Alexandre Miguel Pinto, Luís Moniz Pereira,...