Sciweavers

426 search results - page 45 / 86
» Combining Answer Sets of Nonmonotonic Logic Programs
Sort
View
IJCAI
2001
13 years 9 months ago
A Comparative Study of Logic Programs with Preference
We are interested in semantical underpinnings for existing approaches to preference handling in extended logic programming (within the framework of answer set programming). As a s...
Torsten Schaub, Kewen Wang
ICLP
2003
Springer
14 years 26 days ago
Loop Formulas for Disjunctive Logic Programs
Abstract. We extend Clark’s definition of a completed program and the definition of a loop formula due to Lin and Zhao to disjunctive logic programs. Our main result, generaliz...
Joohyung Lee, Vladimir Lifschitz
VL
1993
IEEE
159views Visual Languages» more  VL 1993»
13 years 11 months ago
A Visual Logic Programming Language Based on Sets and Partitioning Constraints
This paper presents a new programming language named SPARCL that has four major elements: it is a visual language, it is a logic programming language, it relies on sets to organiz...
Lindsey L. Spratt, Allen L. Ambler
ECOOP
2009
Springer
14 years 8 months ago
Implicit Dynamic Frames: Combining Dynamic Frames and Separation Logic
The dynamic frames approach has proven to be a powerful formalism for specifying and verifying object-oriented programs. However, it requires writing and checking many frame annota...
Jan Smans, Bart Jacobs 0002, Frank Piessens
JELIA
2010
Springer
13 years 6 months ago
A Normal Form for Linear Temporal Equilibrium Logic
In previous work, the so-called Temporal Equilibrium Logic (TEL) was introduced. This formalism provides an extension of the Answer Set semantics for logic programs to arbirary the...
Pedro Cabalar