95 search results - page 4 / 19 » Ordered completion for logic programs with aggregates |
114
Voted
CHARME
2003
Springer
15 years 5 months ago
2003
Springer
We present a non-operational approach to specifying and analyzing shared memory consistency models. The method uses higher order logic to capture a complete set of ordering constra...
104
Voted
IJCAI
2007
15 years 2 months ago
2007
We present a fully connectionist system for the learning of first-order logic programs and the generation of corresponding models: Given a program and a set of training examples,...
114
Voted
FOSSACS
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We introduce an extension of Hoare logic for call-by-value higherorder functions with ML-like local reference generation. Local references may be generated dynamically an...
106
Voted
AAAI
2008
15 years 3 months ago
2008
We formulate loop formulas for logic programs with arbitrary constraint atoms, for the semantics based on conditional satisfaction. This provides a method for answer set computati...
128
Voted
ASIAN
2006
Springer
15 years 4 months ago
2006
Springer
Interesting properties of programs can be expressed using contextual equivalence. The latter is difficult to prove directly, hence (pre-)logical relations are often used as a tool ...