290 search results - page 3 / 58 » Logical Properties of Name Restriction |
99
Voted
ECAI
2010
Springer
15 years 2 months ago
2010
Springer
The verification problem for action logic programs with non-terminating behaviour is in general undecidable. In this paper, we consider a restricted setting in which the problem be...
109
click to vote
CAV
1999
Springer
15 years 6 months ago
1999
Springer
BDDs and their algorithms implement a decision procedure for Quanti ed Propositional Logic. BDDs are a kind of acyclic automata. Unrestricted automata (recognizing unbounded string...
112
Voted
ASP
2003
Springer
15 years 7 months ago
2003
Springer
In this paper we define the notion of a compatibility relation so as to have a common framework for three nonmonotonic reasoning systems: normal logic programming, extended logic ...
143
click to vote
PODC
1990
ACM
15 years 5 months ago
1990
ACM
Abstract. We introduce a novel extension of propositional modal logic that is interpreted over Kripke structures in which a value is associated with every possible world. These val...
111
Voted
APAL
2005
15 years 1 months ago
2005
We introduce a generalization of Independence Friendly (IF) logic in which Eloise (the player) is restricted to a finite amount of information about Abelard's ('s) move...