746 search results - page 74 / 150 » Connectionist Propositional Logic |
89
Voted
FOSSACS
2007
Springer
15 years 4 months ago
2007
Springer
We study the complexity of satisfiability for the expressive extension ICPDL of PDL (Propositional Dynamic Logic), which admits intersection and converse as program operations. Ou...
75
Voted
CAV
2003
Springer
15 years 3 months ago
2003
Springer
Run-time monitoring of temporal properties and assertions is used for testing and as a component of execution-based model checking techniques. Traditional run-time monitoring howev...
80
Voted
LORI
2009
Springer
15 years 2 months ago
2009
Springer
Abstract. The aim of this work is propose a logical approach to intention dynamics based on the notion of assignment [7, 3]. The function of an assignment is to associate the truth...
77
Voted
ERSHOV
2001
Springer
15 years 2 months ago
2001
Springer
There are many different ways of proving formulas in proposition logic. Many of these can easily be characterized as forms of resolution (e.g. [12] and [9]). Others use so-called...
77
Voted
CSR
2006
Springer
15 years 1 months ago
2006
Springer
We present a method to convert the construction of binary decision diagrams (BDDs) into extended resolution proofs. Besides in proof checking, proofs are fundamental to many applic...