Results 61 to 70 of about 29,860 (193)
Positive Almost-Sure Termination: Complexity and Proof Rules
Proceedings of the ACM on Programming LanguagesWe study the recursion-theoretic complexity of Positive Almost-Sure Termination (PAST) in an imperative programming language with rational variables, bounded nondeterministic choice, and discrete probabilistic choice. A program terminates positive almost-surely if, for every scheduler, the program terminates almost-surely and the expected ...
Rupak Majumdar, V. R. Sathiyanarayana
openaire +3 more sources
Termination Analysis of Active Rules with Priorities [PDF]
, 2003 This paper presents an algorithm for termination static analysis of active rules with priorities. Active rules termination is an undecidable problem. Several recent works have suggested proving termination by using the concept of triggering graph. We propose here a refinement of these works, exploiting the priorities defined between rules. We introduce
openaire +2 more sources
STATUTORY CANCELLATION OF THE LEASING CONTRACT - CONDITIONS AND EFFECTS [PDF]
Challenges of the Knowledge Society, 2016 The leasing contract termination by cancellation may have both a conventional (commissioria lex) and a legal nature. The legislature has stipulated in the leasing operations governing rules a number of cases in which the parties are entitled to request ...
Raluca Antoanetta TOMESCU
doaj
F1000ResearchBackground This study analyzes Saudi Arabia’s 2022–2023 reforms to the Commercial Agency Law through legal, economic, and comparative lenses. The pre-reform regime—marked by rigid nationality limits, procedural burdens, and litigation-prone termination ...
Hajed A. Alotaibi, Abdullah Ali Alasmari
doaj +1 more source
Termination analysis of active rules modular sets [PDF]
Proceedings of the tenth international conference on Information and knowledge management, 2001 This paper presents an algorithm for static termination analysis of active rules in a context of modular design. Several recent works have suggested proving termination by using the concept of triggering graph. We propose here an original approach, based on these works, and that allows to guarantee the termination of a set of rules, conceived by ...
openaire +1 more source
F1000ResearchBackground This study analyzes Saudi Arabia’s 2022–2023 reforms to the Commercial Agency Law through legal, economic, and comparative lenses. The pre-reform regime—marked by rigid nationality limits, procedural burdens, and litigation-prone termination ...
Hajed A. Alotaibi, Abdullah Ali Alasmari
doaj +1 more source
F1000ResearchBackground This study analyzes Saudi Arabia’s 2022–2023 reforms to the Commercial Agency Law through legal, economic, and comparative lenses. The pre-reform regime—marked by rigid nationality limits, procedural burdens, and litigation-prone termination ...
Hajed A. Alotaibi, Abdullah Ali Alasmari
doaj +1 more source
On termination of one rule rewrite systems
Theoretical Computer Science, 1994 AbstractThe undecidability of the termination of rewrite systems is usually proved by reduction to the halting of Turing machines. In particular, Dauchet proves the undecidability of the termination of one rule rewrite systems by coding Turing machines into one rule rewrite systems.
openaire +2 more sources
Fuzzy sets-based control rules for terminating algorithms
Computer Science Journal of Moldova, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jose L. VERDEGAY, Edmundo VERGARA-MORENO
openaire +2 more sources
THE RIGHT OF WITHDRAWAL FOR CONSUMPTION CONTRACTS [PDF]
Challenges of the Knowledge Society, 2011 The romanian legislature in its attempt to align the national legislation with European law requirements stated by a series of acts the right of termination in some consumer contracts.The rule is not a general application one of this category of ...
MOISE BOJINCA
doaj