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...
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...
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...
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...
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...