Sciweavers

543 search results - page 25 / 109
» A Theory of the Quasi-Static World
Sort
View
NIPS
2007
14 years 11 months ago
Learning and using relational theories
Much of human knowledge is organized into sophisticated systems that are often called intuitive theories. We propose that intuitive theories are mentally represented in a logical ...
Charles Kemp, Noah Goodman, Joshua B. Tenenbaum
IJCAI
1997
14 years 11 months ago
Compiling Reasoning with and about Preferences into Default Logic
We address the problem of introducing preferences into default logic. Two approaches are given, one a generalisation of the other. In the first approach, an ordered default theory...
James P. Delgrande, Torsten Schaub
LICS
2002
IEEE
15 years 2 months ago
Computational Adequacy for Recursive Types in Models of Intuitionistic Set Theory
This paper provides a unifying axiomatic account of the interpretation of recursive types that incorporates both domain-theoretic and realizability models as concrete instances. O...
Alex K. Simpson
CSCLP
2008
Springer
14 years 11 months ago
An Efficient Decision Procedure for Functional Decomposable Theories Based on Dual Constraints
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...
Khalil Djelloul
CADE
2007
Springer
15 years 10 months ago
Solving Quantified Verification Conditions Using Satisfiability Modulo Theories
Abstract. First order logic provides a convenient formalism for describing a wide variety of verification conditions. Two main approaches to checking such conditions are pure first...
Yeting Ge, Clark Barrett, Cesare Tinelli