Search results for "orderings"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
92	Jean Goubault-Larrecq	Well-Founded Recursive Relations.	CSL	2001	DBLP DOI BibTeX RDF	well-foundedness, path orderings, Knuth-Bendix orderings, higher-order path orderings, graphs, automata, Termination, calculus
88	Jean-Pierre Jouannaud, Albert Rubio	Polymorphic higher-order recursive path orderings.	J. ACM	2007	DBLP DOI BibTeX RDF	Automated termination prover tool, Gödel's polymorphic recursor, higher-order rewriting, termination orderings, typed lambda calculus
79	Danny De Schreye, Alexander Serebrenik	Acceptability with General Orderings.	Computational Logic: Logic Programming and Beyond	2002	DBLP DOI BibTeX RDF	orderings, acceptability, termination analysis
79	Alexander Serebrenik, Danny De Schreye	Non-transformational Termination Analysis of Logic Programs, Based on General Term-Orderings.	LOPSTR (LNCS 2042: Selected Papers)	2000	DBLP DOI BibTeX RDF	acceptability, termination analysis, term-orderings
78	Leo Bachmair, David A. Plaisted	Associative Path Orderings.	RTA	1985	DBLP DOI BibTeX RDF
73	Bing Bing Zhou, Richard P. Brent	On parallel implementation of the one-sided Jacobi algorithm for singular value decompositions.	PDP	1995	DBLP DOI BibTeX RDF	one-sided Jacobi algorithm, column norms, parallel Jacobi orderings, parallel orderings, Fujitsu AP1000, parallel algorithms, sorting, singular value decomposition, singular value decompositions, equivalence, parallel implementation, Jacobian matrices
70	Ulrich Bodenhofer, Josef Küng	Fuzzy orderings in flexible query answering systems.	Soft Comput.	2004	DBLP DOI BibTeX RDF	Flexible query answering systems, Fuzzy orderings, Vague query system, Relational databases
69	Nick Cropper, Ursula Martin	The Classification of Polynomial Orderings on Monadic Terms.	Appl. Algebra Eng. Commun. Comput.	2001	DBLP DOI BibTeX RDF	Termination, Term rewriting systems, Ordinals
69	Albert Rubio	Extension Orderings.	ICALP	1995	DBLP DOI BibTeX RDF
69	Deepak Kapur, G. Sivakumar	Maximal Extensions os Simplification Orderings.	FSTTCS	1995	DBLP DOI BibTeX RDF
69	Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan	The Algorithmic Use of Hypertree Structure and Maximum Neighbourhood Orderings.	WG	1994	DBLP DOI BibTeX RDF
69	Joachim Steinbach	Extensions and Comparison of Simplification Orderings.	RTA	1989	DBLP DOI BibTeX RDF
61	Guillem Godoy, Robert Nieuwenhuis	Constraint Solving for Term Orderings Compatible with Abelian Semigroups, Monoids and Groups.	Constraints An Int. J.	2004	DBLP DOI BibTeX RDF	symbolic constraints, built-in theories, automated deduction, term orderings
60	Franz Baader	Combination of Compatible Reduction Orderings that are Total on Ground Terms.	LICS	1997	DBLP DOI BibTeX RDF
60	Joachim Steinbach	Improving Assoviative Path Orderings.	CADE	1990	DBLP DOI BibTeX RDF
56	Andreas Weiermann	A Computation of the Maximal Order Type of the Term Ordering on Finite Multisets.	CiE	2009	DBLP DOI BibTeX RDF	well-partial orderings, maximal order types, finite multisets, well-quasi orderings, ordinals, term orderings
54	Basile Schaeli, Roger D. Hersch	Dynamic testing of flow graph based parallel applications.	PADTAD	2008	DBLP DOI BibTeX RDF
54	Basile Schaeli, Sebastian Gerlach, Roger D. Hersch	Decomposing Partial Order Execution Graphs to Improve Message Race Detection.	IPDPS	2007	DBLP DOI BibTeX RDF
54	Wilfred Ng	Inferring Functional Dependencies in Linerly Ordered Databases.	DEXA	1998	DBLP DOI BibTeX RDF
52	Luis M. de Campos, José Miguel Puerta	Stochastic Local Algorithms for Learning Belief Networks: Searching in the Space of the Orderings.	ECSQARU	2001	DBLP DOI BibTeX RDF	Stochastic Hill-Climbing Search, Learning, Variable Neighborhood Search, Belief Networks, Causal Orderings
51	Jürgen Stuber	Theory Path Orderings.	RTA	1999	DBLP DOI BibTeX RDF
51	Thomas Arts, Jürgen Giesl	Automatically Proving Termination Where Simplification Orderings Fail.	TAPSOFT	1997	DBLP DOI BibTeX RDF
51	Masahito Kurihara, Hisashi Kondo, Azuma Ohuchi	Completion for Multiple Reduction Orderings.	RTA	1995	DBLP DOI BibTeX RDF
46	Gianni Bosi, Juan Carlos Candeal, Esteban Induráin, Esteban Olóriz, Margarita Zudaire	Numerical Representations of Interval Orders.	Order	2001	DBLP DOI BibTeX RDF	orderings on a set, numerical representations of orderings, interval-orders
46	Maria Paola Bonacina, Nachum Dershowitz	Abstract canonical inference.	ACM Trans. Comput. Log.	2007	DBLP DOI BibTeX RDF	proof orderings, fairness, redundancy, completeness, completion, Inference, saturation, canonicity
45	Marc Bezem, Tore Langholm, Michal Walicki	Completeness and Decidability in Sequence Logic.	LPAR	2007	DBLP DOI BibTeX RDF
45	Didier Dubois, Henri Prade	Approximate and Commonsense Reasoning: From Theory to Practice.	ISMIS	1996	DBLP DOI BibTeX RDF
43	Vincent Astier, Marcus Tressl	Axiomatization of local-global principles for pp-formulas in spaces of orderings.	Arch. Math. Log.	2005	DBLP DOI BibTeX RDF	Spaces of orderings, Special groups, Positive-primitive formulas, Local-global principles, Isotropy theorem, Model theory, Quadratic forms
43	Aleksey Zobnin	Admissible orderings and finiteness criteria for differential standard bases.	ISSAC	2005	DBLP DOI BibTeX RDF	Gröbner bases, admissible orderings, differential algebra
43	Leo Bachmair, Nachum Dershowitz	Equational Inference, Canonical Proofs, and Proof Orderings.	J. ACM	1994	DBLP DOI BibTeX RDF	term rewriting, rewrite systems, proof theory, equational logic, inference systems, term orderings
42	Nicolas Bedon, Alexis Bès, Olivier Carton, Chloe Rispal	Logic and Rational Languages of Words Indexed by Linear Orderings.	CSR	2008	DBLP DOI BibTeX RDF
42	Prasad A. Kulkarni, David B. Whalley, Gary S. Tyson, Jack W. Davidson	In search of near-optimal optimization phase orderings.	LCTES	2006	DBLP DOI BibTeX RDF	genetic algorithms, exhaustive search, phase ordering
42	Alexis Bès, Olivier Carton	A Kleene Theorem for Languages of Words Indexed by Linear Orderings.	Developments in Language Theory	2005	DBLP DOI BibTeX RDF
42	Alberto Marcone	Fine Analysis of the Quasi-Orderings on the Power Set.	Order	2001	DBLP DOI BibTeX RDF	better quasi-ordering, wqo, well quasi-ordering
42	Véronique Bruyère, Olivier Carton	Automata on Linear Orderings.	MFCS	2001	DBLP DOI BibTeX RDF
42	Marcello M. Bonsangue, Joost N. Kok	Semantics, Orderings and Recursion in the Weakest Precondition Calculus.	REX Workshop	1992	DBLP DOI BibTeX RDF	fixed point transformations, Smyth powerdomain, Egli-Milner powerdomain, refinement, deadlock, recursion, fixed points, backtracking, weakest preconditions, predicate transformers
42	Dieter Hofbauer	Termination Proofs by Multiset Path Orderings Imply Primitive Recursive Derivation Lengths.	ALP	1990	DBLP DOI BibTeX RDF
36	Paolo Boldi, Massimo Santini 0001, Sebastiano Vigna	Permuting Web Graphs.	WAW	2009	DBLP DOI BibTeX RDF
36	Shinya Umeno	Event order abstraction for parametric real-time system verification.	EMSOFT	2008	DBLP DOI BibTeX RDF	automatic timing synthesis, counter-example guided abstraction refinement (cegar), event-based approach, parametric verification
36	Mohammad Reza Mousavi 0001, Iain C. C. Phillips, Michel A. Reniers, Irek Ulidowski	The Meaning of Ordered SOS.	FSTTCS	2006	DBLP DOI BibTeX RDF
36	Evelyne Contejean, Claude Marché, Ana Paula Tomás, Xavier Urbain	Mechanically Proving Termination Using Polynomial Interpretations.	J. Autom. Reason.	2005	DBLP DOI BibTeX RDF	polynomial interpretations, termination, term rewriting
36	Bernhard Gramlich, Salvador Lucas	Simple termination of context-sensitive rewriting.	ACM SIGPLAN Workshop on Rule-Based Programming	2002	DBLP DOI BibTeX RDF	automatic proofs of termination, context-sensitive rewriting, modular program analysis and verification, declarative programming, evaluation strategies
36	Gabriel Valiente	A General Method for Graph Isomorphism.	FCT	2001	DBLP DOI BibTeX RDF
36	Feodor F. Dragan, Andreas Brandstädt	Dominating Cliques in Graphs with Hypertree Structures.	STACS	1994	DBLP DOI BibTeX RDF
34	Andreas Blass, Yuri Gurevich	Program termination and well partial orderings.	ACM Trans. Comput. Log.	2008	DBLP DOI BibTeX RDF	covering observation, game criterion, well partial orderings, Program termination
33	Nicolas Bedon	Logic and Bounded-Width Rational Languages of Posets over Countable Scattered Linear Orderings.	LFCS	2009	DBLP DOI BibTeX RDF
33	Jesús Angulo	From Scalar-Valued Images to Hypercomplex Representations and Derived Total Orderings for Morphological Operators.	ISMM	2009	DBLP DOI BibTeX RDF
33	Antonio Montalbán	Countably Complementable Linear Orderings.	Order	2006	DBLP DOI BibTeX RDF	countable linear ordering, extension property, embeddability
33	Alexander Semenov	On Connection Between Constructive Involutive Divisions and Monomial Orderings.	CASC	2006	DBLP DOI BibTeX RDF
33	Maxim Teslenko, Andrés Martinelli, Elena Dubrova	Bound-Set Preserving ROBDD Variable Orderings May Not Be Optimum.	IEEE Trans. Computers	2005	DBLP DOI BibTeX RDF	ROBDD, bound set, variable ordering
33	Véronique Bruyère, Olivier Carton	Hierarchy Among Automata on Linear Orderings.	Theory Comput. Syst.	2005	DBLP DOI BibTeX RDF
33	Mirtha-Lina Fernández, Guillem Godoy, Albert Rubio	Orderings for Innermost Termination.	RTA	2005	DBLP DOI BibTeX RDF
33	Nachum Dershowitz, E. Castedo Ellerman	Leanest Quasi-orderings.	RTA	2005	DBLP DOI BibTeX RDF
33	Pinar Heggernes, Yngve Villanger	Simple and Efficient Modifications of Elimination Orderings.	PARA	2004	DBLP DOI BibTeX RDF
33	Yong Meng Teo, Bhakti S. S. Onggo	Formalization and Strictness of Simulation Event Orderings.	PADS	2004	DBLP DOI BibTeX RDF
33	Chloe Rispal, Olivier Carton	Complementation of Rational Sets on Countable Scattered Linear Orderings.	Developments in Language Theory	2004	DBLP DOI BibTeX RDF
33	Olivier Carton, Chloe Rispal	Complementation of Rational Sets on Scattered Linear Orderings of Finite Rank.	LATIN	2004	DBLP DOI BibTeX RDF
33	Olivier Carton	Accessibility in Automata on Scattered Linear Orderings.	MFCS	2002	DBLP DOI BibTeX RDF
33	Véronique Bruyère, Olivier Carton	Automata on Linear Orderings.	Developments in Language Theory	2002	DBLP DOI BibTeX RDF
33	Deepak Kapur, G. Sivakumar	Proving Associative-Communicative Termination Using RPO-Compatible Orderings.	FTP (LNCS Selection)	1998	DBLP DOI BibTeX RDF
33	Harry Preuß, Anand Srivastav	Blockwise Variable Orderings for Shared BDDs.	MFCS	1998	DBLP DOI BibTeX RDF
33	Piero A. Bonatti, Maria Luisa Sapino, V. S. Subrahmanian	Merging Heterogeneous Security Orderings.	ESORICS	1996	DBLP DOI BibTeX RDF	Theoretical Foundations of Security, Heterogeneous Mediated/Federated Systems
33	Scott Hauck, Gaetano Borriello	Logic Partition Orderings for Multi-FPGA Systems.	FPGA	1995	DBLP DOI BibTeX RDF
33	Joachim Steinbach	Automatic Termination Proofs With Transformation Orderings.	RTA	1995	DBLP DOI BibTeX RDF
33	Elias Dahlhaus, Peter L. Hammer, Frédéric Maffray, Stephan Olariu	On Domination Elimination Orderings and Domination Graphs (Extended Abstract).	WG	1994	DBLP DOI BibTeX RDF
33	Leo Bachmair, Harald Ganzinger	Ordered Chaining for Total Orderings.	CADE	1994	DBLP DOI BibTeX RDF
33	Dieter Hutter	Synthesis of Induction Orderings for Existence Proofs.	CADE	1994	DBLP DOI BibTeX RDF
33	Alberto Pettorossi	Comparing and Putting Together Recursive Path Ordering, Simplification Orderings and Non-Ascending Property for Termination Proofs of Term Rewriting Systems.	ICALP	1981	DBLP DOI BibTeX RDF
31	Susumu Kubo, Kazuhisa Makino, Souta Sakamoto	Composition Orderings for Linear Functions and Matrix Multiplication Orderings.	CoRR	2024	DBLP DOI BibTeX RDF
31	Sergio Abriola, Santiago Figueira	A note on the order type of minoring orderings and some algebraic properties of ω2-well quasi-orderings.	CLEI	2014	DBLP DOI BibTeX RDF
31	Federico Heras, Javier Larrosa	Intelligent variable orderings and re-orderings in DAC-based solvers for WCSP.	J. Heuristics	2006	DBLP DOI BibTeX RDF	Weighted CSPs, Local consistency
31	Uwe Waldmann	Extending Reduction Orderings to ACU-Compatible Reduction Orderings.	Inf. Process. Lett.	1998	DBLP DOI BibTeX RDF
31	Ryu Hasegawa	An Analysis of Divisibility Orderings and Recursive Path Orderings.	ASIAN	1997	DBLP DOI BibTeX RDF
31	Pierre Lescanne	Well Rewrite Orderings and Well Quasi-Orderings.	J. Symb. Comput.	1992	DBLP DOI BibTeX RDF
31	Carl G. Jockusch Jr., Robert I. Soare	Degrees of Orderings Not Isomorphic to Recursive Linear Orderings.	Ann. Pure Appl. Log.	1991	DBLP DOI BibTeX RDF
28	Bikram Sengupta, Rance Cleaveland	An Integrated Framework for Scenarios and State Machines.	IFM	2005	DBLP DOI BibTeX RDF	refinement orderings, scenarios, state-machines, heterogeneous specifications
28	Leo Bachmair, Harald Ganzinger	Ordered Chaining Calculi for First-Order Theories of Transitive Relations.	J. ACM	1998	DBLP DOI BibTeX RDF	chaining calculi, reduction orderings, transitive relations, term rewriting, rewrite systems, equational logic
28	Sonia Mettali Gammar, Farouk Kamoun	A comparison of scheduling algorithms for real time distributed transactional systems.	FTDCS	1997	DBLP DOI BibTeX RDF	real time distributed transactional systems, distributed database update, globally consistent orderings, nonpreemptive earliest deadline first, simulation, distributed databases, concurrency control, consensus, scheduling algorithms, deadlines, serializability, client server, tokens, timeliness, system parameters, database consistency
28	N. Schmechel	On Lattice-Isomorphism Between Fuzzy Equivalence Relations and Fuzzy Partitions.	ISMVL	1995	DBLP DOI BibTeX RDF	fuzzy equivalence relations, bijection, pattern recognition, cluster analysis, fuzzy set theory, partial orderings, equivalence classes, lattice theory, fuzzy partitions, lattice-isomorphism, lattice isomorphism
28	Kimon P. Valavanis, Socrates J. Carelo	An efficient planning technique for robotic assemblies and intelligent robotic systems.	J. Intell. Robotic Syst.	1990	DBLP DOI BibTeX RDF	Organization level, robotic assemblies and systems, task precedence, criticality of tasks-events, valid repetive orderings, automated planning
28	Jean-Pierre Jouannaud, Claude Marché	Completion modulo Associativity, Commutativity and Identity (AC1).	DISCO	1990	DBLP DOI BibTeX RDF	Class rewriting, Constrained rewriting, Completion modulo AC1, Constrained completion, Rewrite orderings, Termination
28	Ravi S. Sandhu	Recognizing Immediacy in an N-Tree Hierarchy and Its Application to Protection Groups.	IEEE Trans. Software Eng.	1989	DBLP DOI BibTeX RDF	immediacy, N-tree hierarchy, protection groups, subgroup relation, inverted rooted trees, access control, data structures, refinement, trees (mathematics), recursively, security of data, set theory, granularity, partial order, multi-access systems, linear orderings, integers
27	Gwendolyn Voskuilen, Faraz Ahmad, T. N. Vijaykumar	Timetraveler: exploiting acyclic races for optimizing memory race recording.	ISCA	2010	DBLP DOI BibTeX RDF	race recording, debugging, determinism, replay
27	Hind Castel-Taleb, Nihal Pekergin	Stochastic Monotonicity in Queueing Networks.	EPEW	2009	DBLP DOI BibTeX RDF
27	Hermann Gruber, Markus Holzer 0001, Michael Tautschnig	Short Regular Expressions from Finite Automata: Empirical Results.	CIAA	2009	DBLP DOI BibTeX RDF
27	Nikos Gorogiannis, Anthony Hunter	Merging First-Order Knowledge Using Dilation Operators.	FoIKS	2008	DBLP DOI BibTeX RDF
27	Thuan Quang Huynh, Abhik Roychoudhury	Memory model sensitive bytecode verification.	Formal Methods Syst. Des.	2007	DBLP DOI BibTeX RDF	Programming language memory models, Software model checking, Bytecode verification
27	Nicolas Bedon, Chloe Rispal	Series-Parallel Languages on Scattered and Countable Posets.	MFCS	2007	DBLP DOI BibTeX RDF
27	Yiling Chen 0001, Lance Fortnow, Evdokia Nikolova, David M. Pennock	Betting on permutations.	EC	2007	DBLP DOI BibTeX RDF	expressive betting, order matching, computational complexity, prediction market
27	Ulrich Bodenhofer, Josef Küng, Susanne Saminger	Flexible Query Answering Using Distance-Based Fuzzy Relations.	Theory and Applications of Relational Structures as Knowledge Instruments	2006	DBLP DOI BibTeX RDF
27	Roman Manevich, John Field, Thomas A. Henzinger, G. Ramalingam, Mooly Sagiv	Abstract Counterexample-Based Refinement for Powerset Domains.	Program Analysis and Compilation	2006	DBLP DOI BibTeX RDF
27	Alexandre Riazanov, Andrei Voronkov	Efficient Checking of Term Ordering Constraints.	IJCAR	2004	DBLP DOI BibTeX RDF
27	Salvador Lucas	mu-term: A Tool for Proving Termination of Context-Sensitive Rewriting.	RTA	2004	DBLP DOI BibTeX RDF
27	Peyman Faratin, Bartel A. Van de Walle	Agent preference relations: strict, indifferent and incomparable.	AAMAS	2002	DBLP DOI BibTeX RDF	(Fuzzy) multi criteria decision making, multi-agent systems, incomparability
27	Parosh Aziz Abdulla, Aletta Nylén	Better is Better than Well: On Efficient Verification of Infinite-State Systems.	LICS	2000	DBLP DOI BibTeX RDF	lossy channel systems, integral relational automata, model checking, Verification, timed Petri nets, infinite-state systems, broadcast protocols
27	Litong Song, Yoshihiko Futamura	A New Termination Approach for Specialization.	SAIG	2000	DBLP DOI BibTeX RDF
27	Robert Nieuwenhuis, José Miguel Rivero	Solved Forms for Path Ordering Constraints.	RTA	1999	DBLP DOI BibTeX RDF
27	Shinichi Morishita	Avoiding Cartesian products for multiple joins.	J. ACM	1997	DBLP DOI BibTeX RDF	database scheme, join expression tree, join strategy, optimality, Cartesian product, semijoin
27	Ursula Martin	Linear Interpretations by Counting Patterns.	RTA	1993	DBLP DOI BibTeX RDF
27	Mark de Berg	Translating Polygons with Applications to Hidden Surface Removal.	SWAT	1990	DBLP DOI BibTeX RDF	separation problems, relative convex hulls, Computational geometry, hidden surface removal