Abstract. Argumentation-based formalisms provide a way of considering the defeasible nature of reasoning with partial and often erroneous knowledge in a given environment. This pro...
We propose an extension of alternating-time temporal logic, that can be used for reasoning about the behavior and abilities of agents under various rationality assumptions. Catego...
This paper presents a Prolog interface to the MiniSat satisfiability solver. Logic programming with satisfiability combines the strengths of the two paradigms: logic programming f...
Termination is an important and well-studied property for logic programs. However, almost all approaches for automated termination analysis focus on definite logic programs, where...
We describe a scheme for moving living code between a set of distributed processes coordinated with unification based Linda operations, and its application to building a comprehen...