Sciweavers

3693 search results - page 289 / 739
» Splitting a Logic Program
Sort
View
LATA
2009
Springer
15 years 11 months ago
Termination of Priority Rewriting
Introducing priorities on rules in rewriting increases their expressive power and helps to limit computations. Priority rewriting is used in rule-based programming as well as in f...
Isabelle Gnaedig
TPHOL
2003
IEEE
15 years 10 months ago
MetaPRL - A Modular Logical Environment
MetaPRL is the latest system to come out of over twenty five years of research by the Cornell PRL group. While initially created at Cornell, MetaPRL is currently a collaborative p...
Jason Hickey, Aleksey Nogin, Robert L. Constable, ...
JLP
2007
114views more  JLP 2007»
15 years 4 months ago
Deaccumulation techniques for improving provability
Several induction theorem provers were developed to verify functional programs mechanically. Unfortunately, automatic verification often fails for functions with accumulating arg...
Jürgen Giesl, Armin Kühnemann, Janis Voi...
ICLP
2009
Springer
16 years 5 months ago
One More Decidable Class of Finitely Ground Programs
When a logic program is processed by an answer set solver, the first task is to generate its instantiation. In a recent paper, Calimeri et el. made the idea of efficient instantiat...
Yuliya Lierler, Vladimir Lifschitz
KBSE
2003
IEEE
15 years 10 months ago
On the automatic evolution of an OS kernel using temporal logic and AOP
Automating software evolution requires both identifying precisely the affected program points and selecting the appropriate modification at each point. This task is particularly ...
Rickard A. Åberg, Julia L. Lawall, Mario S&u...