257 search results - page 4 / 52 » The Complexity of Model Checking for Propositional Default L... |
JOLLI
1998
13 years 7 months ago
1998
When reasoning about complex domains, where information available is usually only partial, nonmonotonic reasoning can be an important tool. One of the formalisms introduced in thi...
LPNMR
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. In this paper, we present a logic R for rule bases by introducing a set of rule connectives. We define both the models and extensions of a rule base. The semantics of ex...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We study complexity of the model-checking problems for LTL with registers (also known as freeze LTL and written LTL ) and for first-order logic with data equality tests (written F...
CADE
2007
Springer
14 years 7 months ago
2007
Springer
We present an encoding that is able to specify LTL bounded model checking problems within the Bernays-Sch?onfinkel fragment of first-order logic. This fragment, which also correspo...
UAI
1994
13 years 8 months ago
1994
A logic is de ned that allows to express information about statistical probabilities and about degrees of belief in speci c propositions. By interpreting the twotypes of probabili...