Sciweavers

107 search results - page 9 / 22
» Reducing Propositional Theories in Equilibrium Logic to Logi...
Sort
View
AIIA
2005
Springer
14 years 1 months ago
Handling Continuous-Valued Attributes in Incremental First-Order Rules Learning
Machine Learning systems are often distinguished according to the kind of representation they use, which can be either propositional or first-order logic. The framework working wi...
Teresa Maria Altomare Basile, Floriana Esposito, N...
FOSSACS
2000
Springer
13 years 11 months ago
A Program Refinement Framework Supporting Reasoning about Knowledge and Time
Abstract. This paper develops a highly expressive semantic framework for program refinement that supports both temporal reasoning and reasoning about the knowledge of a single agen...
Kai Engelhardt, Ron van der Meyden, Yoram Moses
CAV
2003
Springer
107views Hardware» more  CAV 2003»
14 years 29 days 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...
IBERAMIA
2004
Springer
14 years 1 months ago
Decomposing Ordinal Sums in Neural Multi-adjoint Logic Programs
The theory of multi-adjoint logic programs has been introduced as a unifying framework to deal with uncertainty, imprecise data or incomplete information. From the applicative part...
Jesús Medina, Enrique Mérida Caserme...
AAAI
1994
13 years 9 months ago
Representing Multiple Theories
Most Artificial Intelligence programs lack generality because they reason with a single domain theory that is tailored for a specific task and embodies a host of implicit assumpti...
P. Pandurang Nayak