Sciweavers

47 search results - page 3 / 10
» Solving the Round Robin Problem Using Propositional Logic
Sort
View
CAV
2003
Springer
107views Hardware» more  CAV 2003»
13 years 11 months ago
Theorem Proving Using Lazy Proof Explication
Many verification problems reduce to proving the validity of formulas involving both propositional connectives and domain-specific functions and predicates. This paper presents ...
Cormac Flanagan, Rajeev Joshi, Xinming Ou, James B...
PKDD
2005
Springer
125views Data Mining» more  PKDD 2005»
13 years 11 months ago
A Propositional Approach to Textual Case Indexing
Abstract. Problem solving with experiences that are recorded in text form requires a mapping from text to structured cases, so that case comparison can provide informed feedback fo...
Nirmalie Wiratunga, Robert Lothian, Sutanu Chakrab...
UAI
1993
13 years 7 months ago
Probabilistic Assumption-Based Reasoning
In this paper the classical propositional assumption-based model is extended to incorporate probabilities for the assumptions. Then the whole model is placed into the framework of...
Jürg Kohlas, Paul-André Monney
EDM
2010
165views Data Mining» more  EDM 2010»
13 years 7 months ago
Using a Bayesian Knowledge Base for Hint Selection on Domain Specific Problems
A Bayesian Knowledge Base is a generalization of traditional Bayesian Networks where nodes or groups of nodes have independence. In this paper we describe a method of generating a ...
John C. Stamper, Tiffany Barnes, Marvin J. Croy
APIN
2010
107views more  APIN 2010»
13 years 6 months ago
Extracting reduced logic programs from artificial neural networks
Artificial neural networks can be trained to perform excellently in many application areas. While they can learn from raw data to solve sophisticated recognition and analysis prob...
Jens Lehmann, Sebastian Bader, Pascal Hitzler