Results 21 to 30 of about 33,744 (283)
Chase Termination for Guarded Existential Rules [PDF]
Proceedings of the 34th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2015 The chase procedure is considered as one of the most fundamental algorithmic tools in database theory. It has been successfully applied to different database problems such as data exchange, and query answering and containment under constraints, to name a few. One of the central problems regarding the chase procedure is all-instance termination, that is,
Marco Calautti +2 more
openaire +4 more sources
Modular Termination for Second-Order Computation Rules and Application to Algebraic Effect Handlers [PDF]
Logical Methods in Computer Science, 2022 We present a new modular proof method of termination for second-order computation, and report its implementation SOL. The proof method is useful for proving termination of higher-order foundational calculi.
Makoto Hamana
doaj +1 more source
Logical Methods in Computer Science, 2021 The recursive path ordering is an established and crucial tool in term rewriting to prove termination. We revisit its presentation by means of some simple rules on trees (or corresponding terms) equipped with a 'star' as control symbol, signifying a ...
Jörg Endrullis +2 more
doaj +1 more source
The Termination of an Employment Contract Initiated by the Employer’s Will
Teisė, 2021 This article systematically analyses new Labour code rules (regulation from July 2017) and the judicial practice of Lithuania relating to the termination of an employment contract initiated by the employer by employer’s will (Labour Code of the Republic ...
Tomas Bagdanskis
doaj +1 more source
Termination of Rewriting with Right-Flat Rules Modulo Permutative Theories [PDF]
Logical Methods in Computer Science, 2010 We present decidability results for termination of classes of term rewriting systems modulo permutative theories. Termination and innermost termination modulo permutative theories are shown to be decidable for term rewrite systems (TRS) whose right-hand ...
Luis Barguno +3 more
doaj +1 more source
A new proof rule for almost-sure termination [PDF]
Proceedings of the ACM on Programming Languages, 2017 We present a new proof rule for proving almost-sure termination of probabilistic programs, including those that contain demonic non-determinism. An important question for a probabilistic program is whether the probability mass of all its diverging runs is zero, that is that it terminates "almost surely".
Annabelle McIver +3 more
openaire +2 more sources
Dynamic Dependency Pairs for Algebraic Functional Systems [PDF]
Logical Methods in Computer Science, 2012 We extend the higher-order termination method of dynamic dependency pairs to Algebraic Functional Systems (AFSs). In this setting, simply typed lambda-terms with algebraic reduction and separate {\beta}-steps are considered.
Cynthia Kop, Femke van Raamsdonk
doaj +1 more source
Women’s experiences of coping with pregnancy\ud termination for fetal abnormality [PDF]
, 2013 Pregnancy termination for fetal abnormality (TFA) can have significant psychological consequences. Most research focus on measuring the psychological outcome of TFA,\ud and little is known about the coping strategies involved.
Lafarge, Caroline +2 more
core +1 more source
A complete rule for equifair termination
Journal of Computer and System Sciences, 1986 The notion of equifairness, strengthening the familiar notion of fairness, is introduced as a scheduling policy of nondeterminism and concurrency. Under this notion, it is infinitely often the case that the number of selections of each of a family of infinitely often jointly enabled processes is equal.
Orna Grumberg +2 more
openaire +2 more sources
Local Termination: theory and practice [PDF]
Logical Methods in Computer Science, 2010 The characterisation of termination using well-founded monotone algebras has been a milestone on the way to automated termination techniques, of which we have seen an extensive development over the past years.
Joerg Endrullis +2 more
doaj +1 more source