1020 search results - page 1 / 204 » Tight Semantics for Logic Programs |
ICLP
2010
Springer
13 years 8 months ago
2010
Springer
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...
RR
2009
Springer
13 years 11 months ago
2009
Springer
Open Answer Set Programming (OASP) can be seen as a framework to represent tightly integrated combined knowledge bases of ontologies and rules that are not necessarily DL-safe. The...
NMR
2004
Springer
13 years 10 months ago
2004
Springer
We define the class of head-cycle free nested logic programs, and its proper subclass of acyclic nested programs, generalising similar classes originally defined for disjunctive...
FOIKS
2008
Springer
13 years 6 months ago
2008
Springer
AI
2011
Springer
12 years 11 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...