150 search results - page 24 / 30 » The Stable Models of a Predicate Logic Program |
CTCS
1989
Springer
15 years 3 months ago
1989
Springer
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...
111
click to vote
ECAI
2010
Springer
15 years 22 days 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...
FOSSACS
2009
Springer
15 years 6 months ago
2009
Springer
Standard analysis on recursive data structures restrict their attention to shape properties (for instance, a program that manipulates a list returns a list), excluding properties t...
APLAS
2004
ACM
15 years 5 months ago
2004
ACM
This paper develops a mathematical characterisation of object-oriented concepts by defining an observation-oriented semantics for an object-oriented language (OOL) with a rich var...
POPL
2010
ACM
15 years 9 months ago
2010
ACM
d by recent research in abstract model checking, we present a new approach to inferring dependent types. Unlike many of the existing approaches, our approach does not rely on prog...