30 search results - page 5 / 6 » SLT-Resolution for the Well-Founded Semantics |
LPNMR
2009
Springer
15 years 4 months ago
2009
Springer
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...
76
Voted
ICWS
2004
IEEE
14 years 11 months ago
2004
IEEE
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...
PDSE
1998
14 years 11 months ago
1998
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 ...
COLING
2010
14 years 4 months ago
2010
Lexicalized Well-Founded Grammar (LWFG) is a recently developed syntacticsemantic grammar formalism for deep language understanding, which balances expressiveness with provable le...
166
click to vote
AI
2011
Springer
14 years 4 months ago
2011
Springer
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...