443 search results - page 58 / 89 » SAT-Based Answer Set Programming |
DEXA
2005
Springer
14 years 1 months ago
2005
Springer
Finding intensional encapsulations of database subsets is the inverse of query evaluation. Whereas query evaluation transforms an intensional expression (the query) to its extensi...
AMW
2010
13 years 9 months ago
2010
We address the problem of answering conjunctive queries over knowledge bases, specified by sets of first-order sentences called tuple-generating dependencies (TGDs). This problem i...
JELIA
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. The growing size of electronically available text corpora like companies’ intranets or the WWW has made information access a hot topic within computational linguistics....
ACE
2003
13 years 9 months ago
2003
This paper seeks to inform instructors responsible for designing introductory programming courses within a university setting. In particular, guidelines for choosing programming l...
ICLP
2003
Springer
14 years 1 months ago
2003
Springer
We equip ordered logic programs with negation as failure, using a simple generalization of the preferred answer set semantics for ordered programs. This extension supports a conven...