Sciweavers

139 search results - page 1 / 28
» Modular difference logic is hard
Sort
View
CORR
2008
Springer
106views Education» more  CORR 2008»
13 years 5 months ago
Modular difference logic is hard
In connection with machine arithmetic, we are interested in systems of constraints of the form x + k y + k . Over integers, the satisfiability problem for such systems is polynomi...
Nikolaj Bjørner, Andreas Blass, Yuri Gurevi...
ICALP
2007
Springer
13 years 11 months ago
Modular Algorithms for Heterogeneous Modal Logics
Abstract. State-based systems and modal logics for reasoning about them often heterogeneously combine a number of features such as non-determinism and probabilities. Here, we show ...
Lutz Schröder, Dirk Pattinson
LPNMR
2007
Springer
13 years 11 months ago
Modularity Aspects of Disjunctive Stable Models
Practically all programming languages used in software engineering allow to split a program into several modules. For fully declarative and nonmonotonic logic programming languages...
Tomi Janhunen, Emilia Oikarinen, Hans Tompits, Ste...
WCRE
2009
IEEE
13 years 11 months ago
The Logical Modularity of Programs
Abstract—The principles and best practices of object oriented design require that modules in a program should match logical decomposition of the knowledge that the program implem...
Daniel Ratiu, Radu Marinescu, Jan Jürjens
RR
2007
Springer
13 years 11 months ago
Evaluating Formalisms for Modular Ontologies in Distributed Information Systems
Modern semantic technology is one of the necessary supports for the infrastructure of next generation information systems. In particular, large international organizations, which u...
Yimin Wang, Jie Bao, Peter Haase, Guilin Qi