Sciweavers

835 search results - page 116 / 167
» Geometric Logic in Computer Science
Sort
View
ICTCS
2005
Springer
14 years 3 months ago
A Typed Semantics of Higher-Order Store and Subtyping
Abstract. We consider a call-by-value language, with higher-order functions, records, references to values of arbitrary type, and subtyping. We adapt an intrinsic denotational mode...
Jan Schwinghammer
CSE
2009
IEEE
14 years 2 months ago
A Failure Adapted, Load-Balanced Distributed Routing for Wireless Ad Hoc Sensor Networks
— this paper proposes a distributed routing protocol for ad hoc sensor networks which uses Fuzzy Logic. Each sensor uses a Fuzzy decision making process to find the best Cluster ...
Shahram Nourizadeh, Yeqiong Song, Jean-Pierre Thom...
WSPI
2004
13 years 11 months ago
Spinoza's Ontology
Abstract. We examine the possibility of applying knowledge representation and automated reasoning in the context of philosophical ontology. For this purpose, we use the axioms and ...
Jan Hladik
APAL
2007
104views more  APAL 2007»
13 years 10 months ago
Non-well-founded trees in categories
Non-well-founded trees are used in mathematics and computer science, for modelling non-well-founded sets, as well as non-terminating processes or infinite data structures. Catego...
Benno van den Berg, Federico De Marchi
ENTCS
2008
98views more  ENTCS 2008»
13 years 10 months ago
Modal Expressiveness of Graph Properties
Graphs are among the most frequently used structures in Computer Science. In this work, we analyze how we can express some important graph properties such as connectivity, acyclic...
Mario R. F. Benevides, L. Menasché Schechte...