3693 search results - page 458 / 739 » Splitting a Logic Program |
144
Voted
KR
1998
Springer
15 years 7 months ago
1998
Springer
A theory is elaboration tolerant to the extent that new information can be incorporated with only simple changes. The simplest change is conjoining new information, and only conju...
122
Voted
ICALP
2009
Springer
16 years 3 months ago
2009
Springer
We present the first uniquely represented data structure for an external memory model of computation, a B-tree analogue called a B-treap. Uniquely represented data structures repre...
146
click to vote
ICSE
2004
IEEE-ACM
16 years 3 months ago
2004
IEEE-ACM
Our paper introduces a runtime verification framework for concurrent monitoring of applications specified by UML statecharts. The approach offers a considerable degree of granulari...
179
Voted
FROCOS
2009
Springer
15 years 10 months ago
2009
Springer
When trying to apply recently developed approaches for updating Description Logic ABoxes in the context of an action programming language, one encounters two problems. First, upda...
141
click to vote
LICS
2008
IEEE
15 years 10 months ago
2008
IEEE
Variable binding is a prevalent feature of the syntax and proof theory of many logical systems. In this paper, we define a programming language that provides intrinsic support fo...