Sciweavers

1313 search results - page 142 / 263
» Prioritized Reasoning in Logic Programming
Sort
View
AUSAI
2006
Springer
15 years 1 months ago
LPForget: A System of Forgetting in Answer Set Programming
Abstract. A novel declarative approach of forgetting in answer set programming (ASP) has been proposed recently. In this paper we report a system prototype of forgetting in ASP, ca...
Fu-Leung Cheng, Thomas Eiter, Nathan Robinson, Abd...
JELIA
2004
Springer
15 years 3 months ago
On the Relation Between ID-Logic and Answer Set Programming
This paper is an analysis of two knowledge representation extensions of logic programming, namely Answer Set Programming and ID-Logic. Our aim is to compare both logics on the leve...
Maarten Mariën, David Gilis, Marc Denecker
FOSSACS
2009
Springer
15 years 4 months ago
Realizability of Concurrent Recursive Programs
Abstract. We define and study an automata model of concurrent recursive programs. An automaton consists of a finite number of pushdown systems running in parallel and communicati...
Benedikt Bollig, Manuela-Lidia Grindei, Peter Habe...
CSL
2009
Springer
15 years 4 months ago
Nested Hoare Triples and Frame Rules for Higher-Order Store
Separation logic is a Hoare-style logic for reasoning about programs with heap-allocated mutable data structures. As a step toward extending separation logic to high-level language...
Jan Schwinghammer, Lars Birkedal, Bernhard Reus, H...
ICLP
2011
Springer
14 years 1 months ago
Transaction Logic with Defaults and Argumentation Theories
Transaction Logic is an extension of classical logic that gracefully integrates both declarative and procedural knowledge and has proved itself as a powerful formalism for many ad...
Paul Fodor, Michael Kifer