Sciweavers

1061 search results - page 6 / 213
» Dependently Sorted Logic
Sort
View
JACM
2000
86views more  JACM 2000»
14 years 11 months ago
Periodification scheme: constructing sorting networks with constant period
We consider comparator networks M that are used repeatedly: while the output produced by M is not sorted, it is fed again into M. Sorting algorithms working in this way are called ...
Miroslaw Kutylowski, Krzysztof Lorys, Brigitte Oes...
86
Voted
JELIA
2004
Springer
15 years 5 months ago
Combining Decision Procedures for Sorted Theories
The Nelson-Oppen combination method combines decision procedures for theories satisfying certain conditions into a decision procedure for their union. While the method is known to ...
Cesare Tinelli, Calogero G. Zarba
83
Voted
CADE
1994
Springer
15 years 3 months ago
A Mechanization of Strong Kleene Logic for Partial Functions
Even though it is not very often admitted, partial functions do play a significant role in many practical applications of deduction systems. Kleene has already given a semantic acc...
Manfred Kerber, Michael Kohlhase
87
Voted
CADE
2006
Springer
15 years 3 months ago
A Sufficient Completeness Checker for Linear Order-Sorted Specifications Modulo Axioms
We present a tool for checking the sufficient completeness of linear, order-sorted equational specifications modulo associativity, commutativity, and identity. Our tool treats this...
Joe Hendrix, José Meseguer, Hitoshi Ohsaki
JSYML
2008
84views more  JSYML 2008»
14 years 11 months ago
The modal logic of affine planes is not finitely axiomatisable
We consider a modal language for affine planes, with two sorts of formulas (for points and lines) and three modal boxes. To evaluate formulas, we regard an affine plane as a Kripke...
Ian Hodkinson, Altaf Hussain