Sciweavers

1268 search results - page 27 / 254
» One Logic to Use Them All
Sort
View
ECAI
1998
Springer
14 years 2 months ago
The Complexity of Model Checking for Propositional Default Logics
Abstract. Default logic is one of the most widely used formalisms to formalize commonsense reasoning. In this paper we analyze the complexity of deciding whether a propositional in...
Paolo Liberatore, Marco Schaerf
CORR
2007
Springer
126views Education» more  CORR 2007»
13 years 9 months ago
Linear Tabling Strategies and Optimizations
Recently there has been a growing interest of research in tabling in the logic programming community because of its usefulness in a variety of application domains including progra...
Neng-Fa Zhou, Taisuke Sato, Yi-Dong Shen
RTA
2010
Springer
14 years 1 months ago
A Rewriting Logic Semantics Approach to Modular Program Analysis
The K framework, based on rewriting logic semantics, provides a powerful logic for deļ¬ning the semantics of programming languages. While most work in this area has focused on deļ...
Mark Hills, Grigore Rosu
ICLP
1994
Springer
14 years 1 months ago
Splitting a Logic Program
In many cases, a logic program can be divided into two parts, so that one of them, the \bottom" part, does not refer to the predicates de ned in the \top" part. The \bot...
Vladimir Lifschitz, Hudson Turner
JOLLI
2002
109views more  JOLLI 2002»
13 years 9 months ago
Linear, Branching Time and Joint Closure Semantics for Temporal Logic
Temporal logic can be used to describe processes: their behaviour is characterized by a set of temporal models axiomatized by a temporal theory. Two types of models are most often ...
Joeri Engelfriet, Jan Treur