746 search results - page 52 / 150 » Connectionist Propositional Logic |
165
Voted
SPLC
2007
15 years 4 months ago
2007
Feature modeling is a notation and an approach for modeling commonality and variability in product families. In their basic form, feature models contain mandatory/optional feature...
123
Voted
CAV
2009
Springer
15 years 10 months ago
2009
Springer
The DPLL approach to the Boolean satisfiability problem (SAT) is a combination of search for a satisfying assignment and logical deduction, in which each process guides the other....
128
Voted
ECAI
2000
Springer
15 years 7 months ago
2000
Springer
The problem of merging multiple sources information is central in many information processing areas such as databases integration problems, multiple criteria decision making, exper...
134
Voted
CADE
2008
Springer
15 years 5 months ago
2008
Springer
Completion is a general paradigm for applying inferences to generate a canonical presentation of a logical theory, or to semi-decide the validity of theorems, or to answer queries....
132
Voted
AAAI
1990
15 years 4 months ago
1990
An algorithm is described which computes stable models of propositional logic programs with negation as failure using the Assumption Based Truth Maintenance mechanism. Since stabl...