Sciweavers

662 search results - page 95 / 133
» Formalizing Basic First Order Model Theory
Sort
View
DALT
2005
Springer
14 years 2 months ago
Complete Axiomatizations of Finite Syntactic Epistemic States
An agent who bases his actions upon explicit logical formulae has at any given point in time a finite set of formulae he has computed. Closure or consistency conditions on this se...
Thomas Ågotnes, Michal Walicki
ESOP
2010
Springer
14 years 6 months ago
Faulty Logic: Reasoning about Fault Tolerant Programs
Transient faults are single-shot hardware errors caused by high energy particles from space, manufacturing defects, overheating, and other sources. Such faults can be devastating f...
Matthew L. Meola and David Walker
ICWE
2004
Springer
14 years 2 months ago
Semantic Capabilities for the Metrics and Indicators Cataloging Web System
In this paper we thoroughly discuss design and implementation issues for semantic search and navigation to ontology-based metrics and indicators metadata. These semantic search and...
Hernán Molina, Fernanda Papa, María ...
SAC
2000
ACM
14 years 1 months ago
Making Tuple Spaces Safe for Heterogeneous Distributed Systems
Linda is a high level communication model which allows agents to communicate via a shared tuple spaces without knowing each other’s identities and without having to arrange for ...
Naftaly H. Minsky, Yaron Minsky, Victoria Ungurean...
POPL
2004
ACM
14 years 9 months ago
Parsing expression grammars: a recognition-based syntactic foundation
For decades we have been using Chomsky's generative system of grammars, particularly context-free grammars (CFGs) and regular expressions (REs), to express the syntax of prog...
Bryan Ford