458 search results - page 27 / 92 » An Algebraic Approach to Sharing Analysis of Logic Programs |
CADE
2007
Springer
14 years 9 months ago
2007
Springer
Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that combines 1) Boolean algebra of sets of uninterpreted elements (BA) and 2) Presburger arithmetic (PA). BA...
AAAI
2006
13 years 10 months ago
2006
We establish a declarative theory of forgetting for disjunctive logic programs. The suitability of this theory is justified by a number of desirable properties. In particular, one...
AI
2010
Springer
13 years 8 months ago
2010
Springer
Combining constraints using logical connectives such as disjunction is ubiquitous in constraint programming, because it adds considerable expressive power to a constraint language...
WCRE
2009
IEEE
14 years 3 months ago
2009
IEEE
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...
CONCUR
1990
Springer
14 years 24 days ago
1990
Springer
In this paper we describe the calculus TCCS, an extension of the process algebra CCS with temporal constructs. The calculus is useful for the formal analysis of the timing aspects...