71 search results - page 2 / 15 » Decidability Under the Well-Founded Semantics |
ICLP
2009
Springer
14 years 2 months ago
2009
Springer
The seemingly simple choice of whether to use call variance or call subsumption in a tabled evaluation deeply affects an evaluation’s properties. Most tabling implementations hav...
AI
2011
Springer
13 years 2 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...
POPL
2011
ACM
12 years 10 months ago
2011
ACM
We define a new logic, STRAND, that allows reasoning with heapmanipulating programs using deductive verification and SMT solvers. STRAND logic (“STRucture ANd Data” logic) f...
LICS
2003
IEEE
14 years 27 days ago
2003
IEEE
We consider several questions related to the use of digitization techniques for timed automata. These very successful techniques reduce dense-time language inclusion problems to d...
AAAI
1990
13 years 8 months ago
1990
Since knowledge bases (KBs) are usually incomplete, they should be able to provide information regarding their own incompleteness, which requires them to introspect on what they k...