611 search results - page 62 / 123 » Yuri, Logic, and Computer Science |
HICSS
2003
IEEE
15 years 3 months ago
2003
IEEE
If sufficient attention is not paid to the information models on which Learning Platforms are based the ability to deliver rich functionality is hindered. This paper describes the...
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...
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...
CSR
2008
Springer
14 years 10 months ago
2008
Springer
An (n, k)-ary quantifier is a generalized logical connective, binding k variables and connecting n formulas. Canonical systems with (n, k)-ary quantifiers form a natural class of G...
ENTCS
2006
14 years 9 months ago
2006
It is common practice in both theoretical computer science and theoretical physics to describe the (static) logic of a system by means of a complete lattice. When formalizing the d...