Sciweavers

1151 search results - page 118 / 231
» Collaborative Programming: Applications of Logic and Automat...
Sort
View
DLOG
2007
15 years 6 months ago
Partitioning ABoxes Based on Converting DL to Plain Datalog
Abstract. To make ABox reasoning scalable for large ABoxes in description logic (DL) knowledge bases, we develop a method for partitioning the ABox so that specific kinds of reaso...
Jianfeng Du, Yi-Dong Shen
TARK
2007
Springer
15 years 9 months ago
Dealing with logical omniscience
We examine four approaches for dealing with the logical omniscience problem and their potential applicability: the syntactic approach, awareness, algorithmic knowledge, and imposs...
Joseph Y. Halpern, Riccardo Pucella
DLOG
2011
14 years 7 months ago
Repairing Incomplete Reasoners
Abstract. The pressing need for scalable query answering has motivated the development of many incomplete ontology-based reasoners. Improving the completeness of such systems witho...
Giorgos Stoilos, Bernardo Cuenca Grau
152
Voted
KR
2010
Springer
15 years 8 months ago
Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth Is not Enough
Cardinality constraints or, more generally, weight constraints are well recognized as an important extension of answer-set programming. Clearly, all common algorithmic tasks relat...
Reinhard Pichler, Stefan Rümmele, Stefan Szei...
ICLP
2011
Springer
14 years 7 months ago
Constraints in Non-Boolean Contexts
In high-level constraint modelling languages, constraints can occur in non-Boolean contexts: implicitly, in the form of partial functions, or more explicitly, in the form of const...
Leslie De Koninck, Sebastian Brand, Peter J. Stuck...