Sciweavers

1193 search results - page 30 / 239
» A primer of simple theories
Sort
View
TPLP
2008
89views more  TPLP 2008»
14 years 11 months ago
Theory of finite or infinite trees revisited
We present in this paper a first-order axiomatization of an extended theory T of finite or infinite trees, built on a signature containing an infinite set of function symbols and ...
Khalil Djelloul, Thi-Bich-Hanh Dao, Thom W. Fr&uum...
SASO
2007
IEEE
15 years 6 months ago
Desynchronization: The Theory of Self-Organizing Algorithms for Round-Robin Scheduling
The study of synchronization has received much attention in a variety of applications, ranging from coordinating sensors in wireless networks to models of fireflies flashing in...
Ankit Patel, Julius Degesys, Radhika Nagpal
HASKELL
2005
ACM
15 years 5 months ago
Verifying haskell programs using constructive type theory
Proof assistants based on dependent type theory are closely related to functional programming languages, and so it is tempting to use them to prove the correctness of functional p...
Andreas Abel, Marcin Benke, Ana Bove, John Hughes,...
KI
1999
Springer
15 years 4 months ago
Revising Nonmonotonic Theories: The Case of Defeasible Logic
Abstract. The revision and transformation of knowledge is widely recognized as a key issue in knowledge representation and reasoning. Reasons for the importance of this topic are t...
David Billington, Grigoris Antoniou, Guido Governa...
ICDT
1990
ACM
110views Database» more  ICDT 1990»
15 years 3 months ago
Beginnings of a Theory of General Database Completions
Ordinary logical implication is not enough for answering queries in a logic database, since especially negative information is only implicitly represented in the database state. M...
Stefan Brass