Sciweavers

489 search results - page 44 / 98
» Reasoning about confidentiality at requirements engineering ...
Sort
View
TIME
1994
IEEE
15 years 4 months ago
Belief Revision in a Discrete Temporal Probability-Logic
We describe a discrete time probabilitylogic for use as the representation language of a temporal knowledge base. In addition to the usual expressive power of a discrete temporal ...
Scott D. Goodwin, Howard J. Hamilton, Eric Neufeld...
BPM
2005
Springer
141views Business» more  BPM 2005»
15 years 6 months ago
Towards a Framework for the Agile Mining of Business Processes
Abstract. In order to support business processes effectively, their implementation by a process management systems (PMS) must be as close to the real world’s processes as possib...
Barbara Weber, Manfred Reichert, Stefanie Rinderle...
SADFE
2010
IEEE
14 years 10 months ago
Fonts for Forensics
: Like other latent evidence that cannot be directly perceived by people, bit sequences have to be presented through tools. Presentations of digital forensic evidence often involve...
Fred Cohen
C3S2E
2010
ACM
15 years 1 months ago
Scalable formula decomposition for propositional satisfiability
Propositional satisfiability solving, or SAT, is an important reasoning task arising in numerous applications, such as circuit design, formal verification, planning, scheduling or...
Anthony Monnet, Roger Villemaire
106
Voted
CAISE
2003
Springer
15 years 5 months ago
Ontological Basis for Agent ADL
Abstract. Multi-Agent Systems (MAS) architectures are gaining popularity over traditional ones for building open, distributed or evolving software. To formally define system archit...
Stéphane Faulkner, Manuel Kolp