Sciweavers

4126 search results - page 443 / 826
» Relationships with other Formalisms
Sort
View
LICS
2010
IEEE
15 years 5 months ago
Breaking Paths in Atomic Flows for Classical Logic
This work belongs to a wider effort aimed at eliminating syntactic bureaucracy from proof systems. In this paper, we present a novel cut elimination procedure for classical propos...
Alessio Guglielmi, Tom Gundersen, Lutz Straß...
PKDD
2010
Springer
193views Data Mining» more  PKDD 2010»
15 years 5 months ago
Process Mining Meets Abstract Interpretation
Mining Meets Abstract Interpretation J. Carmona and J. Cortadella Universitat Polit`ecnica de Catalunya, Spain The discovery of process models out of system traces is a problem tha...
Josep Carmona, Jordi Cortadella
QEST
2010
IEEE
15 years 4 months ago
DTMC Model Checking by SCC Reduction
Discrete-Time Markov Chains (DTMCs) are a widely-used formalism to model probabilistic systems. On the one hand, available tools like PRISM or MRMC offer efficient model checking a...
Erika Ábrahám, Nils Jansen, Ralf Wim...
ICMLA
2009
15 years 4 months ago
Learning Parameters for Relational Probabilistic Models with Noisy-Or Combining Rule
Languages that combine predicate logic with probabilities are needed to succinctly represent knowledge in many real-world domains. We consider a formalism based on universally qua...
Sriraam Natarajan, Prasad Tadepalli, Gautam Kunapu...
ICSOC
2009
Springer
15 years 4 months ago
A Reassessment of Enterprise Architecture Implementation
Abstract. Aside of day-to-day business in some organizations Enterprise Architecture (EA) seems to be successful while it is not in others that also have notations, models, methods...
Stephan Aier, Joachim Schelp