3693 search results - page 569 / 739 » Splitting a Logic Program |
152
click to vote
ICALP
1995
Springer
15 years 10 months ago
1995
Springer
We describe the rst parallel algorithm with optimal speedup for constructing minimum-width tree decompositions of graphs of bounded treewidth. On n-vertex input graphs, the algori...
164
Voted
ICLP
1991
Springer
15 years 10 months ago
1991
Springer
Well Founded Semantics is adequate to capture nonmonotonic reasoning if we interpret the Well Founded model of a program P as a (possibly incomplete) view of the world. Thus the W...
149
click to vote
DLOG
2007
15 years 8 months ago
2007
Abstract. To make ABox reasoning scalable for large ABoxes in description logic (DL) knowledge bases, we develop a method for partitioning the ABox so that specific kinds of reaso...
170
Voted
AMAST
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Declarative debugging has been applied to many declarative programming paradigms; in this paper, a declarative debugger for rewriting logic specifications, embodied in th...
199
click to vote
FMCAD
2008
Springer
15 years 8 months ago
2008
Springer
We present a method for verifying information flow properties of software programs using inductive assertions and theorem proving. Given a program annotated with information flow a...