2291 search results - page 266 / 459 » Logic Programming and Model Checking |
122
click to vote
LATA
2009
Springer
15 years 9 months ago
2009
Springer
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...
144
click to vote
TABLEAUX
1995
Springer
15 years 6 months ago
1995
Springer
In constraint logic programming, proof procedures for Horn clauses are enhanced with an interface to efficient constraint solvers. In this paper we show how to incorporate constra...
118
click to vote
ICALP
1998
Springer
15 years 6 months ago
1998
Springer
We show that characteristic formulae for nite-state systems up to bisimulationlike equivalences (e.g., strong and weak bisimilarity) can be given in the simple branching-time temp...
128
click to vote
APPINF
2003
15 years 3 months ago
2003
We present an application prototype of dynamic knowledge representation programmed in LUPS (a language for updating logic programs). This is a case study to model intelligent agen...
123
click to vote
ATVA
2004
Springer
15 years 6 months ago
2004
Springer
While model checking suffers from the state space explosion problem, theorem proving is quite tedious and impractical for verifying complex designs. In this work, we present a veri...