746 search results - page 63 / 150 » Connectionist Propositional Logic |
86
Voted
ADC
2006
Springer
15 years 4 months ago
2006
Springer
We extend Fagin’s result on the equivalence between functional dependencies in relational databases and propositional Horn clauses. It is shown that this equivalence still holds...
IJCAI
1993
14 years 11 months ago
1993
These notes discuss formalizing contexts as first class objects. The basic relation is ist(c, p). It asserts that the proposition p is true in the context c. The most important f...
CADE
2008
Springer
15 years 10 months ago
2008
Springer
Bit vectors and bit operations are proposed for efficient propositional inference. Bit arithmetic has efficient software and hardware implementations, which can be put to advantage...
87
Voted
SOFSEM
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. The dependency pair method is a powerful method for automatically proving termination of rewrite systems. When used with traditional simplification orders like LPO and K...
70
Voted
IGPL
2008
14 years 10 months ago
2008
We study a logic whose formulae are interpreted as properties of a finite set over some universe. The language is propositional, with two unary operators inclusion and extension, ...