Sciweavers

1743 search results - page 137 / 349
» Generalized Modal Satisfiability
Sort
View
124
Voted
AAAI
2000
15 years 4 months ago
The Complexity of Restricted Consequence Finding and Abduction
We analyze the complexity of propositional kernel resolution (del Val 1999), a general method for obtaining logical consequences in restricted target languages. Different choices ...
Alvaro del Val
ICONIP
1998
15 years 4 months ago
A Web Oriented Recurrent Neural Network Simulator
YANNS (Yet Another Neural Network Simulator) is a new object-oriented neural network simulator for feedforward networks as well as general recurrent networks. The goal of this pro...
Romuald Boné, Michel Crucianu, Pascal Makri...
IJCAI
1997
15 years 4 months ago
A Causal Time Ontology for Qualitative Reasoning
Aiming at explicit description of temporal meaning of causal relations generated by qualitative reasoning systems, this article proposes a causal time ontology which defines a se...
Yoshinobu Kitamura, Mitsuru Ikeda, Riichiro Mizogu...
119
Voted
CORR
2010
Springer
146views Education» more  CORR 2010»
15 years 3 months ago
Adaptive Submodularity: A New Approach to Active Learning and Stochastic Optimization
Solving stochastic optimization problems under partial observability, where one needs to adaptively make decisions with uncertain outcomes, is a fundamental but notoriously diffic...
Daniel Golovin, Andreas Krause
112
Voted
COMBINATORICS
2006
126views more  COMBINATORICS 2006»
15 years 3 months ago
The Induced Subgraph Order on Unlabelled Graphs
A differential poset is a partially ordered set with raising and lowering operators U and D which satisfy the commutation relation DU-UD = rI for some constant r. This notion may ...
Craig A. Sloss