Results 11 to 20 of about 33,744 (283)
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
Alain Couchot, Couchot, Alain
core +4 more sources
CLEI Electronic Journal, 2007 This work presents proof rules for termination and non-termination for a subset of a C-like language that consists of the statements : assignation,composition, if, skip and while and rules for termination of function calls.
Patricia Peratto
doaj +2 more sources
Conditional rewrite rules: Confluence and termination [PDF]
Journal of Computer and System Sciences, 1986 The authors consider conditional rewrite rules: \[ \bigwedge^{n}_{i=0}(t_ i\@s_ i)\quad \Rightarrow \quad (t\to s)\quad,\quad where\quad \@\in (=,|,\to \to \}\quad, \] and four corresponding term rewriting systems (TRS); 0 for \(n=0,\) I for \(n=0\) and \(\@\) is \(=,\) II for \(n=0\) and \(\@\) is \(|\), and III for \(n=0\) and \(\@\) is \(\to \to ...
J.A. Bergstra (Jan) +1 more
openaire +4 more sources
The Impact of the Termination Rule on Cooperation in a Prisoner's Dilemma Experiment [PDF]
SSRN Electronic Journal, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Normann, Hans-Theo, Wallace, Brian
openaire +6 more sources
Representation and termination analysis for ECA rules based on extended Petri net [PDF]
Tongxin xuebao, 2013 In order to improve the accuracy of the termination an lysis on ECA rules, a novel representation model (EPN, extended Petri net) of ECA rules was built. Based on the EPN, an effective termination decision algorithm was discussed and proposed.
Li-chen ZHANG +2 more
doaj +4 more sources
Termination of Dependently Typed Rewrite Rules. [PDF]
, 2015 Our interest is in automated termination proofs of higher-order rewrite rules in presence of dependent types modulo a theory T on base types. We first describe an original transformation to a type discipline without type dependencies which preserves non-termination.
Jouannaud, Jean-Pierre, Li, Jianqi
openaire +4 more sources
Termination Properties of Transition Rules for Indirect Effects
Proceedings of the International Conference on Automated Planning and SchedulingIndirect effects of agent's actions have traditionally been formalized as condition-effect rules that always fire whenever applicable, after each action taken by the agent. In this work, we investigate a core problem of indirect effects, the possibility of arbitrarily or infinitely long sequences of rule firings.
Rintanen Jussi +2 more
openaire +2 more sources
Toward an Ideal Particle Swarm Optimizer for Multidimensional Functions
Information, 2022 The Particle Swarm Optimization (PSO) method is a global optimization technique based on the gradual evolution of a population of solutions called particles. The method evolves the particles based on both the best position of each of them in the past and
Vasileios Charilogis, Ioannis G. Tsoulos
doaj +1 more source
An Intelligent Technique for Initial Distribution of Genetic Algorithms
Axioms, 2023 The need to find the global minimum in multivariable functions is a critical problem in many fields of science and technology. Effectively solving this problem requires the creation of initial solution estimates, which are subsequently used by the ...
Vasileios Charilogis +2 more
doaj +1 more source
Use RBF as a Sampling Method in Multistart Global Optimization Method
Signals, 2022 In this paper, a new sampling technique is proposed that can be used in the Multistart global optimization technique as well as techniques based on it.
Ioannis G. Tsoulos +2 more
doaj +1 more source