49 search results - page 7 / 10 » Uniform Equivalence of Logic Programs under the Stable Model... |
ECAI
2010
Springer
13 years 8 months ago
2010
Springer
Logic programs under the stable models semantics, or answer-set programs, provide an expressive rule based knowledge representation framework, featuring formal, declarative and wel...
ESOP
2010
Springer
14 years 5 months ago
2010
Springer
Formal reasoning about concurrent programs is usually done with the assumption that the underlying memory model is sequentially consistent, i.e. the execution outcome is equivalen...
AMAI
2008
Springer
13 years 7 months ago
2008
Springer
In a previous paper [BMR01], the authors showed that the mechanism underlying Logic Programming can be extended to handle the situation where the atoms are interpreted as subsets o...
AAAI
2004
13 years 9 months ago
2004
We propose and study extensions of logic programming with constraints represented as generalized atoms of the form C(X), where X is a finite set of atoms and C is act constraint (...
CASCON
2004
13 years 9 months ago
2004
For several reasons a database may not satisfy certain integrity constraints (ICs), for example, when it is the result of integrating several independent data sources. However, mo...