746 search results - page 80 / 150 » Connectionist Propositional Logic |
83
Voted
CORR
2006
Springer
14 years 10 months ago
2006
Springer
We investigate here concept learning from incomplete examples. Our first purpose is to discuss to what extent logical learning settings have to be modified in order to cope with da...
111
Voted
AIML
2004
14 years 11 months ago
2004
abstract. The aim of the present paper is to analyze the complexity of strict implication (together with falsum, conjunction and disjunction). We prove that Ladner's Theorem r...
68
Voted
ISSS
1997
IEEE
15 years 2 months ago
1997
IEEE
This paper presents a model for simultaneous instruction selection, compaction, and register allocation. An arc mapping model along with logical propositions is used to create an ...
86
Voted
ISMIS
1994
Springer
15 years 2 months ago
1994
Springer
BDDs (binary decision diagrams) are a very succesful tool for handling boolean functions, but one which has not yet attracted the attention of many automated deduction specialists....
91
Voted
COMMA
2008
14 years 11 months ago
2008
Proposals for logic-based argumentation have the potential to be adapted for handling diverse kinds of knowledge. In this paper, a calculus for representing temporal knowledge is p...