Sciweavers

4401 search results - page 645 / 881
» Computing with Default Logic
Sort
View
IJDAR
2002
108views more  IJDAR 2002»
15 years 4 months ago
Document understanding for a broad class of documents
We present a document analysis system able to assign logical labels and extract the reading order in a broad set of documents. All information sources, from geometric features and ...
Marco Aiello, Christof Monz, Leon Todoran
CP
2010
Springer
15 years 3 months ago
Domain Consistency with Forbidden Values
This paper presents a novel domain-consistency algorithm which does not maintain supports dynamically during propagation, but rather maintain forbidden values. It introduces the op...
Yves Deville, Pascal Van Hentenryck
CORR
2008
Springer
148views Education» more  CORR 2008»
15 years 3 months ago
Efficiently Simulating Higher-Order Arithmetic by a First-Order Theory Modulo
In deduction modulo, a theory is not represented by a set of axioms but by a congruence on propositions modulo which the inference rules of standard deductive systems--such as for ...
Guillaume Burel
LOGCOM
2010
96views more  LOGCOM 2010»
15 years 3 months ago
The Complexity of the Warranted Formula Problem in Propositional Argumentation
The notion of warrant or justification is one of the central concepts in formal models of argumentation. The dialectical definition of warrant is expressed in terms of recursive...
Robin Hirsch, Nikos Gorogiannis
SYNTHESE
2010
130views more  SYNTHESE 2010»
15 years 3 months ago
Belief ascription under bounded resources
There exists a considerable body of work on epistemic logics for resource-bounded reasoners. In this paper, we concentrate on a less studied aspect of resource-bounded reasoning, n...
Natasha Alechina, Brian Logan