Sciweavers

140 search results - page 23 / 28
» Stable Models and Non-Determinism in Logic Programs with Neg...
Sort
View
98
Voted
LPNMR
2005
Springer
15 years 5 months ago
Answer Sets for Propositional Theories
Equilibrium logic, introduced by David Pearce, extends the concept of an answer set from logic programs to arbitrary sets of formulas. Logic programs correspond to the special case...
Paolo Ferraris
CTCS
1989
Springer
15 years 3 months ago
Quantitative Domains, Groupoids and Linear Logic
We introduce the notion of a candidate for “multiple valued universal constructions” and define stable functors (which generalise functors with left adjoints) in terms of fac...
Paul Taylor 0002
111
Voted
ECAI
2010
Springer
15 years 23 days ago
On Semantic Update Operators for Answer-Set Programs
Logic programs under the stable models semantics, or answer-set programs, provide an expressive rule based knowledge representation framework, featuring formal, declarative and wel...
Martin Slota, João Leite
APAL
2006
94views more  APAL 2006»
14 years 11 months ago
Classifiable theories without finitary invariants
: It follows directly from Shelah's structure theory that if T is a classifiable theory, then the isomorphism type of any model of T is determined by the theory of that model ...
Elisabeth Bouscaren, Ehud Hrushovski
ICLP
2009
Springer
16 years 9 days ago
Answer Set Programming with Constraints Using Lazy Grounding
The paper describes a novel methodology to compute stable models in Answer Set Programming. The proposed approach relies on a bottom-up computation that does not require a prelimin...
Agostino Dovier, Alessandro Dal Palù, Enric...