71 search results - page 2 / 15 » The disjunctive decomposition of logic functions |
TOCL
2010
13 years 3 months ago
2010
NIPS
2001
13 years 6 months ago
2001
We give results about the learnability and required complexity of logical formulae to solve classification problems. These results are obtained by linking propositional logic with...
ISMVL
1997
IEEE
13 years 9 months ago
1997
IEEE
The composition tree of a given function, when it exists, provides a representation of the function revealing all possible disjunctive decompositions, thereby suggesting a realiza...
LPNMR
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. This paper describes a system called SELP for studying strong equivalence in answer set logic programming. The basic function of the system is to check if two given groun...
ICLP
2010
Springer
13 years 9 months ago
2010
Springer
Probabilistic Logic Programming is an active field of research, with many proposals for languages, semantics and reasoning algorithms. One such proposal, Logic Programming with A...