Sciweavers

3134 search results - page 45 / 627
» Computing full disjunctions
Sort
View
ASP
2005
Springer
14 years 3 months ago
Combining Answer Sets of Nonmonotonic Logic Programs
This paper studies compositional semantics of nonmonotonic logic programs. We suppose the answer set semantics of extended disjunctive programs and consider the following problem. ...
Chiaki Sakama, Katsumi Inoue
ECAI
2008
Springer
13 years 11 months ago
Online Rule Learning via Weighted Model Counting
Online multiplicative weight-update learning algorithms, such as Winnow, have proven to behave remarkably for learning simple disjunctions with few relevant attributes. The aim of ...
Frédéric Koriche
IJCAI
2001
13 years 11 months ago
Neural Logic Network Learning using Genetic Programming
Neural Logic Network or Neulonet is a hybrid of neural network expert systems. Its strength lies in its ability to learn and to represent human logic in decision making using comp...
Chew Lim Tan, Henry Wai Kit Chia
ATVA
2010
Springer
154views Hardware» more  ATVA 2010»
13 years 11 months ago
Lattice-Valued Binary Decision Diagrams
Abstract. This work introduces a new data structure, called Lattice-Valued Binary Decision Diagrams (or LVBDD for short), for the compact representation and manipulation of functio...
Gilles Geeraerts, Gabriel Kalyon, Tristan Le Gall,...
JAIR
2006
106views more  JAIR 2006»
13 years 10 months ago
Clause/Term Resolution and Learning in the Evaluation of Quantified Boolean Formulas
Resolution is the rule of inference at the basis of most procedures for automated reasoning. In these procedures, the input formula is first translated into an equisatisfiable for...
Enrico Giunchiglia, Massimo Narizzano, Armando Tac...