213 search results - page 14 / 43 » A framework for checking proofs naturally |
IJCAI
2007
14 years 11 months ago
2007
Diagnosability of systems is an essential property that determines how accurate any diagnostic reasoning can be on a system given any sequence of observations. Generally, in the l...
ATAL
2008
Springer
14 years 11 months ago
2008
Springer
In the last few years, argumentation frameworks have been successfully applied to multi agent systems. Recently, argumentation has been used to provide a framework for reasoning a...
102
click to vote
FDL
2006
IEEE
15 years 3 months ago
2006
IEEE
Reusing IP-cores to construct system models facilitated by automated generation of glue-logic, and automated composability checks can help designers to create efficient simulation...
AMAI
2004
Springer
15 years 2 months ago
2004
Springer
This paper studies the relative proof complexity of variations of a tableau method for Boolean circuit satisfiability checking obtained by restricting the use of the cut rule in s...
FORMATS
2003
Springer
15 years 2 months ago
2003
Springer
Timed automata are known not to be complementable or determinizable. Natural questions are, then, could we check whether a given TA enjoys these properties? These problems are not...