Sciweavers

271 search results - page 12 / 55
» Observational Completeness on Abstract Interpretation
Sort
View
VMCAI
2012
Springer
12 years 2 months ago
Ideal Abstractions for Well-Structured Transition Systems
stractions for Well-Structured Transition Systems Damien Zufferey1 , Thomas Wies2 , and Thomas A. Henzinger1 1 IST Austria 2 New York University Many infinite state systems can be...
Damien Zufferey, Thomas Wies, Thomas A. Henzinger
ENTCS
2007
97views more  ENTCS 2007»
13 years 6 months ago
Process Algebra Having Inherent Choice: Revised Semantics for Concurrent Systems
Process algebras are standard formalisms for compositionally describing systems by the dependencies of their observable synchronous communication. In concurrent systems, parallel ...
Harald Fecher, Heiko Schmidt
ILP
2004
Springer
14 years 2 days ago
Learning Logic Programs with Annotated Disjunctions
Abstract. Logic Programs with Annotated Disjunctions (LPADs) provide a simple and elegant framework for integrating probabilistic reasoning and logic programming. In this paper we ...
Fabrizio Riguzzi
AML
2002
131views more  AML 2002»
13 years 6 months ago
Fuzzy logic, continuity and effectiveness
Abstract. It is shown the complete equivalence between the theory of continuous (enumeration) fuzzy closure operators and the theory of (effective) fuzzy deduction systems in Hilbe...
Loredana Biacino, Giangiacomo Gerla
ECAI
1998
Springer
13 years 11 months ago
The Complexity of Model Checking for Propositional Default Logics
Abstract. Default logic is one of the most widely used formalisms to formalize commonsense reasoning. In this paper we analyze the complexity of deciding whether a propositional in...
Paolo Liberatore, Marco Schaerf