Sciweavers

2436 search results - page 244 / 488
» Comonadic Notions of Computation
Sort
View
AAAI
1998
15 years 8 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
AAAI
1997
15 years 8 months ago
Detecting Unsatisfiable CSPs by Coloring the Micro-Structure
Constraint satisfaction research has focussed on consistency checking using k-consistency and its variations such as arc-consistency, and path-consistency. We define a new form of...
Daya Ram Gaur, W. Ken Jackson, William S. Havens
IWFM
1998
125views Formal Methods» more  IWFM 1998»
15 years 8 months ago
Mathematics for Formal Methods, a Proposal for Education Reform
It is widely recognized that there is a body of mathematics which is crucial to the underpinning of computer science, software engineering, and information and communications tech...
Mícheál Mac an Airchinnigh
ECSCW
1993
15 years 8 months ago
Design for Unanticipated Use..
: Support for work practice is better conceptualised as support for activity taking place in a multidimensional space than as prescription of temporal task sequences. The notion of...
Mike Robinson
ANLP
1992
100views more  ANLP 1992»
15 years 7 months ago
An Approach To Multilevel Semantics For Applied Systems
Multilevel semantics has been proposed as a powerful architecture for semantic analysis. We propose a methodology that, while maintaining the generality of the multilevel approach...
Alberto Lavelli, Bernardo Magnini, Carlo Strappara...