77 search results - page 10 / 16 » Reasoning by Cases without Contraposition in Default Logic |
CADE
2007
Springer
14 years 7 months ago
2007
Springer
Abstract. Automata-based decision procedures commonly achieve optimal complexity bounds. However, in practice, they are often outperformed by sub-optimal (but more local-search bas...
ISSTA
2009
ACM
14 years 2 months ago
2009
ACM
Dynamic test generation consists of executing a program while gathering symbolic constraints on inputs from predicates encountered in branch statements, and of using a constraint ...
EXPERT
2006
13 years 7 months ago
2006
on abstract principles that you can't easily apply in a formal, deductive fashion. So, the favorite tools of logicians and mathematicians, such as firstorder logic, aren'...
FLOPS
2004
Springer
14 years 29 days ago
2004
Springer
Sharing among program variables is vital information when analyzing logic programs. This information is often expressed either as sets or as pairs of program variables that (may) s...
CSL
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. This paper is part of a general project of developing a systematic and algebraic proof theory for nonclassical logics. Generalizing our previous work on intuitionistic-su...