Sciweavers

4401 search results - page 206 / 881
» Computing with Default Logic
Sort
View
ECAI
2006
Springer
15 years 8 months ago
CTL Model Update: Semantics, Computations and Implementation
Minimal change is a fundamental principle for modeling system dynamics. In this paper, we study the issue of minimal change for Computational Tree Logic (CTL) model update. We firs...
Yulin Ding, Yan Zhang
ERSA
2007
113views Hardware» more  ERSA 2007»
15 years 5 months ago
Autonomous Computing Systems: A Proof-of-Concept
This paper describes a proof-of-concept implementation of a basic autonomous computing system. The system consists of an XUP Virtex-II Pro board running Linux and a set of softwar...
Neil Steiner, Peter M. Athanas
IJCAI
2001
15 years 5 months ago
Computing Strongest Necessary and Weakest Sufficient Conditions of First-Order Formulas
A technique is proposed for computing the weakest sufficient (wsc) and strongest necessary (snc) conditions for formulas in an expressive fragment of first-order logic using quant...
Patrick Doherty, Witold Lukaszewicz, Andrzej Szala...
ICDE
2004
IEEE
124views Database» more  ICDE 2004»
16 years 5 months ago
Authenticating Query Results in Edge Computing
Edge computing pushes application logic and the underlying data to the edge of the network, with the aim of improving availability and scalability. As the edge servers are not nec...
HweeHwa Pang, Kian-Lee Tan
WILF
2007
Springer
125views Fuzzy Logic» more  WILF 2007»
15 years 10 months ago
Computational Humour: Utilizing Cross-Reference Ambiguity for Conversational Jokes
This paper presents a computer implementation that utilizes cross-reference ambiguity in utterances for simple conversational jokes. The approach is based on the SSTH. Using a simp...
Hans Wim Tinholt, Anton Nijholt