Sciweavers

77 search results - page 2 / 16
» Automating Leibniz's Theory of Concepts
Sort
View
ICALP
2004
Springer
13 years 10 months ago
Extensional Theories and Rewriting
This paper is an attempt to develop a unifying algebraic framework for extensional theories capturing formally the informal concept of extensionality, as well as a generic automate...
Grigore Rosu
KR
2000
Springer
13 years 8 months ago
Approximate Objects and Approximate Theories
We propose to extend the ontology of logical AI to include approximate objects, approximate predicates and approximate theories. Besides the ontology we treat the relations among ...
John McCarthy
TARK
2007
Springer
13 years 11 months ago
Generalized solution concepts in games with possibly unaware players
Most work in game theory assumes that players are perfect reasoners and have common knowledge of all significant aspects of the game. In earlier work [Halpern and Rˆego 2006], w...
Leandro Chaves Rêgo, Joseph Y. Halpern
LICS
2002
IEEE
13 years 10 months ago
The Proof Complexity of Linear Algebra
We introduce three formal theories of increasing strength for linear algebra in order to study the complexity of the concepts needed to prove the basic theorems of the subject. We...
Michael Soltys, Stephen A. Cook
LPNMR
2005
Springer
13 years 10 months ago
Answer Sets for Propositional Theories
Equilibrium logic, introduced by David Pearce, extends the concept of an answer set from logic programs to arbitrary sets of formulas. Logic programs correspond to the special case...
Paolo Ferraris