Download:
|
by Carlos Areces, Juan Heguiabehere
Proceedings of Advances in Modal Logic (AiML'02
http://www.illc.uva.nl/Publications/ResearchReports/PP-2002-15.text.ps.gz
Add To MetaCart
Abstract:
Abstract: In recent years, an important number of theoretical results concerning axiomatizability, proof systems (tableaux, natural deduction, etc.), interpolation, expressive power, complexity, etc. for hybrid logics has been obtained. The next natural step is to develop provers that can handle these languages. HyLoRes is a direct resolution prover for hybrid logics implementing a sound and complete algorithm for satisfiability of sentences in H (@;#). The most interesting distinguishing feature of HyLoRes is that it is not based on tableau algorithms but on (direct) resolution. 1 Hybrid logics and HyLoRes Hybrid languages are modal languages that allow direct reference to the elements of a model. The basic hybrid language (H (@)) extends the basic modal language simply by the addition of a new set of atomic symbols called nominals (usually denoted as i; j; k; : ::) which name particular points in the model (i.e., the interpretation of a nominal i in a model M = hW;R;V i is an element i M 2W), and for each nominal i a satisfiability operator @ i. This extension already increases the expressive power of the language as we can now explicitly check whether the point of evaluation w is the specific point named i in the model M: M; w
i iff w = i
Citations
|
1128
|
Monads for functional programming
– Wadler
- 1992
|
|
226
|
RACER system description
– Haarslev, Moller
- 2001
|
|
99
|
Resolution theorem proving
– Bachmair, Ganzinger
|
|
77
|
Hybrid logics: characterization, interpolation and complexity
– Areces, Blackburn, et al.
- 2001
|
|
74
|
Using the universal modality: Gains and questions
– Goranko, Passy
- 1992
|
|
72
|
Internalizing labelled deduction
– Blackburn
|
|
71
|
A road-map on complexity for hybrid logics
– Areces, Blackburn, et al.
- 1999
|
|
54
|
A SAT-based decision procedure for ALC
– Giunchiglia, Sebastiani
- 1996
|
|
47
|
DLP system description
– Patel-Schneider
- 1998
|
|
43
|
A benchmark method for the propositional modal logics
– Balsiger, Heuerding, et al.
|
|
31
|
Equational Reasoning in SaturationBased Theorem Proving
– Bachmair, Ganzinger
- 1998
|
|
29
|
Paramodulation and theorem-proving in first-order theories with equality
– Robinson, Wos
- 1969
|
|
27
|
Logic Engineering. The Case of Description and Hybrid Logics
– Areces
- 2000
|
|
17
|
Design and results of the Tableaux-99 Non-Classical (Modal) Systems Comparison
– Massacci
- 1999
|
|
14
|
Strategies for modal resolution: results and problems
– Auffray, Enjalbert, et al.
- 1990
|
|
13
|
Rijke. Resolution in modal, description and hybrid logic
– Areces, Nivelle, et al.
- 2001
|
|
10
|
MSPASS: Subsumption testing with SPASS
– Hustadt, Schmidt, et al.
- 1999
|
|
9
|
Algorithms, datastructures, and other issues in efficient automated deduction
– Voronkov
- 2001
|
|
6
|
The random modal QBF test set
– Heguiabehere, Rijke
- 2001
|
|
5
|
The anatomy of Vampire
– Voronkov
- 1995
|
|
3
|
FaCT and iFaCT. In Lambrix et al
– Horrocks
|
|
3
|
A new very-general method to generate random modal formulae for testing decision procedures
– Patel-Schneider, Sebastiani
- 2002
|
