Sciweavers

30 search results - page 5 / 6
» SLT-Resolution for the Well-Founded Semantics
Sort
View
LPNMR
2009
Springer
14 years 2 months ago
Layer Supported Models of Logic Programs
Building upon the 2-valued Layered Models semantics for normal programs, we introduce a refinement — the Layer Supported Models semantics — which, besides keeping all of LMs...
Luís Moniz Pereira, Alexandre Miguel Pinto
ICWS
2004
IEEE
13 years 8 months ago
Access Control for Semantic Web Services
In this paper we make a contribution to the proof and trust layer of the Semantic Web layer cake by integrating two well founded techniques, namely DAML-S (for describing Web serv...
Sudhir Agarwal, Barbara Sprick
PDSE
1998
131views more  PDSE 1998»
13 years 8 months ago
A Formally Founded Description Technique for Business Processes
As a means of modeling typical system behavior, we present a description technique for business processes derived from data flow nets and provide it with a formal semantics based ...
Veronika Thurner
COLING
2010
13 years 2 months ago
A Learnable Constraint-based Grammar Formalism
Lexicalized Well-Founded Grammar (LWFG) is a recently developed syntacticsemantic grammar formalism for deep language understanding, which balances expressiveness with provable le...
Smaranda Muresan
AI
2011
Springer
13 years 2 months ago
Local closed world reasoning with description logics under the well-founded semantics
An important question for the upcoming Semantic Web is how to best combine open world ontology languages, such as the OWL-based ones, with closed world rule-based languages. One o...
Matthias Knorr, José Júlio Alferes, ...