167 search results - page 27 / 34 » Mathematical Logic and Deduction in Computer Science Educati... |
111
click to vote
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
123
click to vote
JFP
2007
14 years 11 months ago
2007
Software engineering courses offer one of many opportunities for providing students with a significant experience in declarative programming. This report discusses some results fr...
FOCS
2005
IEEE
15 years 5 months ago
2005
IEEE
The automata-theoretic approach is one of the most fundamental approaches to developing decision procedures in mathematical logics. To decide whether a formula in a logic with the...
105
click to vote
IJCAI
2003
15 years 1 months ago
2003
We overview the development of first-order automated reasoning systems starting from their early years. Based on the analysis of current and potential applications of such systems...
105
click to vote
IJCNN
2006
IEEE
15 years 5 months ago
2006
IEEE
—It is proposed that the creation of Artificial General Intelligence (AGI) at the human level and ultimately beyond is a problem addressable via integrating computer science algo...