4555 search results - page 8 / 911 » Deductive Algorithmic Knowledge |
CADE
1999
Springer
14 years 3 days ago
1999
Springer
We reduce the provability problem of any formula of the Lambek calculus to some context-free parsing problem. This reduction, which is based on non-commutative proof-net theory, al...
DAC
2007
ACM
14 years 8 months ago
2007
ACM
Satisfiability (SAT) solvers often benefit from a preprocessing of the formula to be decided. For formulae in conjunctive normal form (CNF), subsumed clauses may be removed or par...
FLAIRS
2006
13 years 9 months ago
2006
In this paper, we describe curricular materials that use the game of Clue to teach basic concepts of propositional logic. While there are many ways of teaching concepts of logic, ...
APAL
2005
13 years 7 months ago
2005
The notions of common knowledge or common belief play an important role in several areas of computer science (e.g. distributed systems, communication), in philosophy, game theory,...
JAPLL
2007
13 years 7 months ago
2007
Starting off from the infinitary system for common knowledge over multi-modal epistemic logic presented in Alberucci and J¨ager [1], we apply the finite model property to “...