Sciweavers

287 search results - page 30 / 58
» Automated abstraction of class diagrams
Sort
View
LICS
2010
IEEE
13 years 6 months ago
On Strong Maximality of Paraconsistent Finite-Valued Logics
Abstract—Maximality is a desirable property of paraconsistent logics, motivated by the aspiration to tolerate inconsistencies, but at the same time retain as much as possible fro...
Arnon Avron, Ofer Arieli, Anna Zamansky
CP
2004
Springer
14 years 29 days ago
Constraint Propagation as a Proof System
Abstract. Refutation proofs can be viewed as a special case of constraint propagation, which is a fundamental technique in solving constraint-satisfaction problems. The generalizat...
Albert Atserias, Phokion G. Kolaitis, Moshe Y. Var...
SCSC
2007
13 years 9 months ago
A graphical variant approach to object-oriented modeling of dynamic systems
Abstract— Graphical variant modeling refers to a novel approach to object-oriented modeling whereby a class overrides behavior inherited from a parent class by specifying variati...
Paul Kinnucan, Pieter J. Mosterman
CSL
2008
Springer
13 years 9 months ago
Pure Pointer Programs with Iteration
not use pointer arithmetic. Such "pure pointer algorithms" thus are a useful abstraction for studying the nature of logspace-computation. In this paper we introduce a for...
Martin Hofmann, Ulrich Schöpp
LICS
1998
IEEE
13 years 11 months ago
Existential Second-Order Logic over Strings
d abstract) T. Eiter G. Gottlob Y. Gurevich Institut fur Informatik Institut fur Informationssysteme EECS Department Universitat Gie en Technische Universitat Wien University of Mi...
Thomas Eiter, Georg Gottlob, Yuri Gurevich