Sciweavers

156 search results - page 12 / 32
» On the notion of uniqueness
Sort
View
AAAI
1998
13 years 11 months ago
A Non-Deterministic Semantics for Tractable Inference
Unit resolution is arguably the most useful known algorithm for tractable reasoning in propositional logic. Intuitively, if one knows a, b, and a b c, then c should be an obviou...
James M. Crawford, David W. Etherington
CRIWG
2000
13 years 11 months ago
Supporting Collaborative Activities in Computer Integrated Classrooms-the NIMIS Approach
This paper presents the concept of a collaborative computer integrated classroom (CiC) specially designed to achieve a unique combination of interactive and collaborative software...
Heinz Ulrich Hoppe, Andreas Lingnau, Isabel Machad...
EACL
1989
ACL Anthology
13 years 11 months ago
Parsing And Derivational Equivalence
It is a tacit assumption of much linguisticinquiry that alldistinctderivations of a string should assign distinct meanings. But despite the tidinessof such derivational uniqueness...
Mark Hepple, Glyn Morrill
FSTTCS
2008
Springer
13 years 11 months ago
Boolean algebras of unambiguous context-free languages
Several recent works have studied subfamilies of deterministic context-free languages with good closure properties, for instance the families of input-driven or visibly pushdown la...
Didier Caucal
CORR
2002
Springer
87views Education» more  CORR 2002»
13 years 9 months ago
Ultimate approximations in nonmonotonic knowledge representation systems
We study xpoints of operators on lattices. To this end we introduce the notion of an approximation of an operator. We order approximations by means of a precision ordering. We sho...
Marc Denecker, V. Wiktor Marek, Miroslaw Truszczyn...