Sciweavers

339 search results - page 14 / 68
» The Retrieval Problem in a Concept Language with Number Rest...
Sort
View
LPNMR
2007
Springer
14 years 1 months ago
Complexity of Rule Redundancy in Non-ground Answer-Set Programming over Finite Domains
Recent research in answer-set programming (ASP) is concerned with the problem of finding faithful transformations of logic programs under the stable semantics. This is in particul...
Michael Fink, Reinhard Pichler, Hans Tompits, Stef...
AIEDAM
2007
191views more  AIEDAM 2007»
13 years 7 months ago
Ontology-based design information extraction and retrieval
Because of the increasing complexity of products and the design process, as well as the popularity of computer-aided documentation tools, the number of electronic and textual desi...
Zhanjun Li, Karthik Ramani
VLDB
2004
ACM
104views Database» more  VLDB 2004»
14 years 7 months ago
Retrieval effectiveness of an ontology-based model for information selection
Technology in the field of digital media generates huge amounts of nontextual information, audio, video, and images, along with more familiar textual information. The potential for...
Latifur Khan, Dennis McLeod, Eduard H. Hovy
CORR
2007
Springer
217views Education» more  CORR 2007»
13 years 7 months ago
Hard constraint satisfaction problems have hard gaps at location 1
An instance of the maximum constraint satisfaction problem (Max CSP) is a nite collection of constraints on a set of variables, and the goal is to assign values to the variables ...
Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen
ICALP
2010
Springer
14 years 13 days ago
Reachability Games on Extended Vector Addition Systems with States
We consider two-player turn-based games with zero-reachability and zero-safety objectives generated by extended vector addition systems with states. Although the problem of decidin...
Tomás Brázdil, Petr Jancar, Anton&ia...