Sciweavers

551 search results - page 71 / 111
» {log}: A Logic Programming Language with Finite Sets
Sort
View
SAS
1993
Springer
104views Formal Methods» more  SAS 1993»
14 years 6 days ago
Strictness Properties of Lazy Algebraic Datatypes
A new construction of a finite set of strictness properties for any lazy algebraic datatype is presented. The construction is based on the categorical view of the solutions to the...
P. N. Benton
TON
2012
11 years 10 months ago
On New Approaches of Assessing Network Vulnerability: Hardness and Approximation
—Society relies heavily on its networked physical infrastructure and information systems. Accurately assessing the vulnerability of these systems against disruptive events is vit...
Thang N. Dinh, Ying Xuan, My T. Thai, Panos M. Par...
IFIP
2010
Springer
13 years 3 months ago
Semantics of Trust
This paper formalizes the semantics of trust and studies the transitivity of trust. On the Web, people and software agents have to interact with "strangers". This makes ...
Tim Muller
ESWS
2007
Springer
14 years 2 months ago
A Reasoning Framework for Rule-Based WSML
WSML is an ontology language specifically tailored to annotate Web Services, and part of its semantics adheres to the rule-based knowledge representation paradigm of logic program...
Stephan Grimm, Uwe Keller, Holger Lausen, Gá...
ATVA
2006
Springer
112views Hardware» more  ATVA 2006»
13 years 12 months ago
Synthesis for Probabilistic Environments
In synthesis we construct finite state systems from temporal specifications. While this problem is well understood in the classical setting of non-probabilistic synthesis, this pap...
Sven Schewe