Free-variable tableaux for monotonic preorders (Q3147362)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1802912
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Free-variable tableaux for monotonic preorders |
scientific article; zbMATH DE number 1802912 |
Statements
Free-variable tableaux for monotonic preorders (English)
0 references
22 April 2003
0 references
free-variable tableaux
0 references
preorders
0 references
0 references
0.92772996
0 references
0 references
0.8582879
0 references
0.8448814
0 references
0.8444289
0 references
0.8434408
0 references
0.84038955
0 references
0 references
0.8381375
0 references
In this paper, free-variable tableaux for dealing with preorders are defined (as special case we have monotonic preorders). Preorders are useful, for instance, in the area of process algebra formalisms. For the nonmonotonic case, the authors define a unification calculus, called \({\mathcal P}\), which is sound, complete and terminating. Next, rewrite strategies are introduced to build a calculus, called \({\mathcal P}_1\), to reduce the \({\mathcal P}\)-search space. When monotonicity is considered, a sound and existentially complete calculus, \({\mathcal M}{\mathcal P}\), is defined in order to solve problems of monotonic preorders. This calculus is not terminating; however, it avoids the use of the function reflexivity axioms.
0 references