Sciweavers

2981 search results - page 239 / 597
» Answer Set Planning
Sort
View
DM
2006
76views more  DM 2006»
15 years 4 months ago
Lex M versus MCS-M
We study the problem of minimal triangulation of graphs. One of the first algorithms to solve this problem was Lex M, which was presented in 1976. A new algorithm, and a simplific...
Yngve Villanger
ARSCOM
2005
94views more  ARSCOM 2005»
15 years 4 months ago
Isometrically Embedded Graphs
Can an arbitrary graph be embedded in Euclidean space so that the isometry group of its vertex set is precisely its graph automorphism group? This paper gives an affirmative answe...
Debra L. Boutin
INFSOF
2000
92views more  INFSOF 2000»
15 years 4 months ago
Identifying relevant constraints for semantic query optimization
Semantic query optimization is the process of utilizing information implied by integrity constraints to reformulate the query into one that generates the same set of answers in a ...
Sang-goo Lee, Lawrence J. Henschen, Jonghun Chun, ...
JELIA
2010
Springer
15 years 2 months ago
The mcs-ie System for Explaining Inconsistency in Multi-Context Systems
The Multi-Context System Inconsistency Explainer allows for evaluation of semantics and explanation of inconsistencies in systems where heterogeneous knowledge bases are linked via...
Markus Bögl, Thomas Eiter, Michael Fink, Pete...
JELIA
2010
Springer
15 years 2 months ago
A Dynamic-Programming Based ASP-Solver
Abstract. We present a novel system for propositional Answer-Set Programming (ASP). This system, called dynASP, is based on dynamic programming and thus significantly differs fro...
Michael Morak, Reinhard Pichler, Stefan Rümme...