1020 search results - page 92 / 204 » Tight Semantics for Logic Programs |
154
Voted
EPIA
2003
Springer
15 years 7 months ago
2003
Springer
Modern information retrieval systems need the capability to reason about the knowledge conveyed by text bases. In this paper a methodology to automatically create ontologies and cl...
235
Voted
POPL
2006
ACM
16 years 2 months ago
2006
ACM
The TCP/IP protocols and Sockets API underlie much of modern computation, but their semantics have historically been very complex and ill-defined. The real standard is the de fact...
122
Voted
SEMWEB
2010
Springer
15 years 14 days ago
2010
Springer
Abstract. The Rule Interchange Format Production Rule Dialect (RIFPRD) is a W3C Recommendation to define production rules for the Semantic Web, whose semantics is defined operation...
243
Voted
POPL
2004
ACM
16 years 2 months ago
2004
ACM
We show how some classical static analyses for imperative programs, and the optimizing transformations which they enable, may be expressed and proved correct using elementary logi...
102
click to vote
LPNMR
2005
Springer
15 years 8 months ago
2005
Springer
Open answer set programming (OASP) is an extension of answer set programming where one may ground a program with an arbitrary superset of the program’s constants. We define a ...