Sciweavers

426 search results - page 46 / 86
» Combining Answer Sets of Nonmonotonic Logic Programs
Sort
View
FLOPS
2004
Springer
14 years 1 months ago
Set-Sharing Is Not Always Redundant for Pair-Sharing
Sharing among program variables is vital information when analyzing logic programs. This information is often expressed either as sets or as pairs of program variables that (may) s...
Francisco Bueno, Maria J. García de la Band...
AI
2011
Springer
13 years 2 months ago
Local closed world reasoning with description logics under the well-founded semantics
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...
Matthias Knorr, José Júlio Alferes, ...
PLILP
1993
Springer
13 years 11 months ago
Narrowing Approximations as an Optimization for Equational Logic Programs
Abstract. Solving equations in equational theories is a relevant programming paradigm which integrates logic and equational programming into one unified framework. Efficient metho...
María Alpuente, Moreno Falaschi, Marí...
IJCAI
2007
13 years 9 months ago
Conjunctive Query Answering for the Description Logic SHIQ
Conjunctive queries play an important role as an expressive query language for Description Logics (DLs). Although modern DLs usually provide for transitive roles, conjunctive quer...
Birte Glimm, Ian Horrocks, Carsten Lutz, Ulrike Sa...
AMAI
2006
Springer
13 years 7 months ago
Strong order equivalence
Abstract. Recently, notions of equivalence for Answer Set Programming have been studied intensively and were shown to be beneficial for modular programming and automated optimizati...
Wolfgang Faber, Kathrin Konczak