1020 search results - page 75 / 204 » Tight Semantics for Logic Programs |
ICLP
1992
Springer
14 years 29 days ago
1992
Springer
CFT is a new constraint system providing records as logical data structure for constraint (logic) programming. It can be seen as a generalization of the rational tree system emplo...
CSL
1995
Springer
14 years 14 days ago
1995
Springer
In this paper we propose to extend the current capabilities of automated reasoning systems by making use of techniques from integer programming. We describe the architecture of an ...
DEXAW
2003
IEEE
14 years 2 months ago
2003
IEEE
We integrate ontology languages and logic programming (LP) by extending disjunctive logic programs (DLPs) and their semantics in order to support inverses and an infinite univers...
ESWS
2005
Springer
14 years 2 months ago
2005
Springer
There is an ongoing discussion whether reasoning in the Semantic Web should be monotonic or not. It seems however that the problem concerns not only the reasoning over knowledge bu...
SEMWEB
2009
Springer
14 years 3 months ago
2009
Springer
Traditional object-oriented programming languages can be difficult to use when working with ontologies, leading to the creation of domain-specific languages designed specifically...