140 search results - page 26 / 28 » Stable Models and Non-Determinism in Logic Programs with Neg... |
103
Voted
KI
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. We aim to demonstrate that automated deduction techniques, in particular those following the model computation paradigm, are very well suited for database schema/query re...
144
Voted
CORR
2002
Springer
15 years 1 months ago
2002
Springer
A relational database is inconsistent if it does not satisfy a given set of integrity constraints. Nevertheless, it is likely that most of the data in it is consistent with the co...
129
Voted
DLT
2006
15 years 3 months ago
2006
Abstract. Boolean grammars [A. Okhotin, Information and Computation 194 (2004) 19-48] are a promising extension of context-free grammars that supports conjunction and negation. In ...
136
Voted
ICTAI
2007
IEEE
15 years 8 months ago
2007
IEEE
We review a method of generating logical rules, or axioms, from empirical data. This method, using closed set properties of formal concept analysis, has been previously described ...
138
click to vote
LOGCOM
2010
15 years 6 days ago
2010
The aim of this paper is double. From one side we survey the knowledge we have acquired these last ten years about the lattice of all λ-theories (= equational extensions of untype...