Sciweavers

37 search results - page 4 / 8
» amai 2004
Sort
View
AMAI
2004
Springer
13 years 11 months ago
Learning via Finitely Many Queries
This work introduces a new query inference model that can access data and communicate with a teacher by asking finitely many boolean queries in a language L. In this model the pa...
Andrew C. Lee
AMAI
2004
Springer
13 years 11 months ago
Unrestricted vs Restricted Cut in a Tableau Method for Boolean Circuits
This paper studies the relative proof complexity of variations of a tableau method for Boolean circuit satisfiability checking obtained by restricting the use of the cut rule in s...
Matti Järvisalo, Tommi A. Junttila, Ilkka Nie...
AMAI
2004
Springer
13 years 9 months ago
Using Logic Programs to Reason about Infinite Sets
Using the ideas from current investigations in Knowledge Representation we study the use of a class of logic programs for reasoning about infinite sets. Those programs assert code...
Douglas A. Cenzer, V. Wiktor Marek, Jeffrey B. Rem...
AMAI
2004
Springer
13 years 11 months ago
Deductive Algorithmic Knowledge
The framework of algorithmic knowledge assumes that agents use algorithms to compute the facts they explicitly know. In many cases of interest, a logical theory, rather than a par...
Riccardo Pucella
AMAI
2004
Springer
13 years 5 months ago
Logical Preference Representation and Combinatorial Vote
We introduce the notion of combinatorial vote, where a group of agents (or voters) is supposed to express preferences and come to a common decision concerning a set of non-independ...
Jérôme Lang