50 search results - page 8 / 10 » On the relation among answer set solvers |
FQAS
2004
Springer
13 years 11 months ago
2004
Springer
In the context of relational as well as deductive databases, correct and efficient integrity checking is a crucial issue, as, without any guarantee of data consistency, the answers...
DATE
2008
IEEE
14 years 1 months ago
2008
IEEE
With the advance of SAT solvers, transforming a software program to a propositional formula has generated much interest for bounded model checking of software in recent years. How...
SIGMOD
2011
ACM
12 years 10 months ago
2011
ACM
An important means of allowing non-expert end-users to pose ad hoc queries — whether over single databases or data integration systems — is through keyword search. Given a set...
SUM
2010
Springer
13 years 5 months ago
2010
Springer
Dung's abstract argumentation model consists of a set of arguments and a binary relation encoding attacks among arguments. Different acceptability semantics have been defined ...
SIGMOD
2012
ACM
11 years 10 months ago
2012
ACM
How-To queries answer fundamental data analysis questions of the form: “How should the input change in order to achieve the desired output”. As a Reverse Data Management probl...