Sciweavers

90 search results - page 13 / 18
» Automated theorem proving in quasigroup and loop theory
Sort
View
KBSE
1998
IEEE
13 years 11 months ago
Planning Equational Verification in CCS
Most efforts to automate formal verification of communicating systems have centred around finite-state systems (FSSs). However, FSSs are incapable of modelling many practical comm...
Raul Monroy, Alan Bundy, Ian Green
JLP
2007
114views more  JLP 2007»
13 years 6 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...
LPAR
2001
Springer
13 years 11 months ago
A Local System for Classical Logic
Abstract. The calculus of structures is a framework for specifying logical systems, which is similar to the one-sided sequent calculus but more general. We present a system of infe...
Kai Brünnler, Alwen Fernanto Tiu
KR
1998
Springer
13 years 11 months ago
Explanatory Diagnosis: Conjecturing Actions to Explain Observations
Our concern in this paper is with conjecturing diagnoses to explain what happened to a system, given a theory of system behaviour and some observed (aberrant) behaviour. We charac...
Sheila A. McIlraith
PLILP
1993
Springer
13 years 10 months ago
Narrowing Approximations as an Optimization for Equational Logic Programs
Abstract. Solving equations in equational theories is a relevant programming paradigm which integrates logic and equational programming into one unified framework. Efficient metho...
María Alpuente, Moreno Falaschi, Marí...