Sciweavers

1635 search results - page 86 / 327
» Reasoning from Data Rather than Theory
Sort
View
CSL
2004
Springer
14 years 2 months ago
The Boundary Between Decidability and Undecidability for Transitive-Closure Logics
To reason effectively about programs, it is important to have some version of a transitive-closure operator so that we can describe such notions as the set of nodes reachable from ...
Neil Immerman, Alexander Moshe Rabinovich, Thomas ...
ASM
2003
ASM
14 years 2 months ago
A Framework for Proving Contract-Equipped Classes
r in: Abstract State Machines 2003 — Advances in Theory and Applications, Proc. 10th International Workshop, Taormina, Italy, March 3-7, 2003, eds. Egon Boerger, Angelo Gargantin...
Bertrand Meyer
CHI
2004
ACM
14 years 9 months ago
Remarkable computing: the challenge of designing for the home
The vision of ubiquitous computing is floating into the domain of the household, despite arguments that lessons from design of workplace artefacts cannot be blindly transferred in...
Marianne Graves Petersen
BMCBI
2007
171views more  BMCBI 2007»
13 years 9 months ago
An open source infrastructure for managing knowledge and finding potential collaborators in a domain-specific subset of PubMed,
Background: Identifying relevant research in an ever-growing body of published literature is becoming increasingly difficult. Establishing domain-specific knowledge bases may be a...
Wei Yu, Ajay Yesupriya, Anja Wulf, Junfeng Qu, Mui...
ILP
2007
Springer
14 years 3 months ago
Using ILP to Construct Features for Information Extraction from Semi-structured Text
Machine-generated documents containing semi-structured text are rapidly forming the bulk of data being stored in an organisation. Given a feature-based representation of such data,...
Ganesh Ramakrishnan, Sachindra Joshi, Sreeram Bala...