Matches in SemOpenAlex for { <https://semopenalex.org/work/W2023342223> ?p ?o ?g. }
Showing items 1 to 78 of
78
with 100 items per page.
- W2023342223 abstract "In the context of constructive synthesis of sorting algorithms, starting from the specification of the problem (input and output conditions), the proof of existence of a sorted tuple is performed inductively and we design, implement, and experiment with different proof techniques: First we use a back-chaining mechanism similar to a Prolog engine for first order logic, in which meta-variables are used for finding the existential witnesses. In order to overcome the search space explosion, we introduce various specific prove-solve methods for the theory of tuples. For instance, the equivalence relation on tuples have same elements'' can be treated using a normal form based on multisets -- this leads to a very efficient inference rule for rewriting. When reasoning about sorting, we also have an ordering relation between elements. We extend this to an ordering between an element and a tuple, and even between tuples. Ordering relations create specific problems in Prolog style reasoning, because of transitivity and reflexivity. We demonstrate that ordering can be treated very efficiently by decomposing atomic statements into simpler ones (containing only symbols instead of terms), both for goals (backward reasoning) as well as for assumptions (forward reasoning). This leads to an interesting combination of backward and forward inferences which goes beyond and complements Prolog style reasoning. Finally, we develop a solving mechanism for finding sorted tuples, which performs the proof more efficiently, by combining relatively simple inference rules and small searches with goal directed solving rules. The techniques are implemented in the Theorem a system and are able to produce automatically proofs and algorithms for various problems: Insertion Sort, Insertion, Merge Sort, and Merge. Besides the special proof techniques, this work also gives useful hints about finding appropriate induction principles for tuples, as well as for the construction of appropriate collections of properties of tuples which are necessary for reasoning about sorting." @default.
- W2023342223 created "2016-06-24" @default.
- W2023342223 creator A5001991801 @default.
- W2023342223 creator A5021113261 @default.
- W2023342223 date "2011-09-01" @default.
- W2023342223 modified "2023-09-27" @default.
- W2023342223 title "Proof Techniques for Synthesis of Sorting Algorithms" @default.
- W2023342223 cites W144988442 @default.
- W2023342223 cites W158294426 @default.
- W2023342223 cites W1672621201 @default.
- W2023342223 cites W1902468750 @default.
- W2023342223 cites W193298535 @default.
- W2023342223 cites W1992696924 @default.
- W2023342223 cites W2013373314 @default.
- W2023342223 cites W2045323411 @default.
- W2023342223 cites W2051841963 @default.
- W2023342223 cites W2120926795 @default.
- W2023342223 cites W2133093325 @default.
- W2023342223 cites W3010782316 @default.
- W2023342223 doi "https://doi.org/10.1109/synasc.2011.23" @default.
- W2023342223 hasPublicationYear "2011" @default.
- W2023342223 type Work @default.
- W2023342223 sameAs 2023342223 @default.
- W2023342223 citedByCount "8" @default.
- W2023342223 countsByYear W20233422232012 @default.
- W2023342223 countsByYear W20233422232014 @default.
- W2023342223 countsByYear W20233422232015 @default.
- W2023342223 countsByYear W20233422232019 @default.
- W2023342223 crossrefType "proceedings-article" @default.
- W2023342223 hasAuthorship W2023342223A5001991801 @default.
- W2023342223 hasAuthorship W2023342223A5021113261 @default.
- W2023342223 hasConcept C11413529 @default.
- W2023342223 hasConcept C118615104 @default.
- W2023342223 hasConcept C118930307 @default.
- W2023342223 hasConcept C199360897 @default.
- W2023342223 hasConcept C202854965 @default.
- W2023342223 hasConcept C33923547 @default.
- W2023342223 hasConcept C3746660 @default.
- W2023342223 hasConcept C41008148 @default.
- W2023342223 hasConcept C80444323 @default.
- W2023342223 hasConcept C81721847 @default.
- W2023342223 hasConceptScore W2023342223C11413529 @default.
- W2023342223 hasConceptScore W2023342223C118615104 @default.
- W2023342223 hasConceptScore W2023342223C118930307 @default.
- W2023342223 hasConceptScore W2023342223C199360897 @default.
- W2023342223 hasConceptScore W2023342223C202854965 @default.
- W2023342223 hasConceptScore W2023342223C33923547 @default.
- W2023342223 hasConceptScore W2023342223C3746660 @default.
- W2023342223 hasConceptScore W2023342223C41008148 @default.
- W2023342223 hasConceptScore W2023342223C80444323 @default.
- W2023342223 hasConceptScore W2023342223C81721847 @default.
- W2023342223 hasLocation W20233422231 @default.
- W2023342223 hasOpenAccess W2023342223 @default.
- W2023342223 hasPrimaryLocation W20233422231 @default.
- W2023342223 hasRelatedWork W111435178 @default.
- W2023342223 hasRelatedWork W124262502 @default.
- W2023342223 hasRelatedWork W1506460945 @default.
- W2023342223 hasRelatedWork W1531724428 @default.
- W2023342223 hasRelatedWork W1672621201 @default.
- W2023342223 hasRelatedWork W1803582651 @default.
- W2023342223 hasRelatedWork W1835790624 @default.
- W2023342223 hasRelatedWork W193298535 @default.
- W2023342223 hasRelatedWork W1988598795 @default.
- W2023342223 hasRelatedWork W2056263775 @default.
- W2023342223 hasRelatedWork W2058596314 @default.
- W2023342223 hasRelatedWork W2110418930 @default.
- W2023342223 hasRelatedWork W2120926795 @default.
- W2023342223 hasRelatedWork W2133093325 @default.
- W2023342223 hasRelatedWork W2153639879 @default.
- W2023342223 hasRelatedWork W2400310231 @default.
- W2023342223 hasRelatedWork W2495951634 @default.
- W2023342223 hasRelatedWork W3010782316 @default.
- W2023342223 hasRelatedWork W3193303649 @default.
- W2023342223 hasRelatedWork W2021355313 @default.
- W2023342223 isParatext "false" @default.
- W2023342223 isRetracted "false" @default.
- W2023342223 magId "2023342223" @default.
- W2023342223 workType "article" @default.