Consistency in networks of relations

From MaRDI portal

Publication:1231783

Jump to:navigation, search

DOI10.1016/0004-3702(77)90007-8zbMath0341.68061OpenAlexW2135432705WikidataQ63090281 ScholiaQ63090281MaRDI QIDQ1231783

Alan K. Mackworth

Publication date: 1977

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0004-3702(77)90007-8

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) General topics in the theory of software (68N01)

Related Items

General game playing with stochastic CSP, Non-local configuration of component interfaces by constraint satisfaction, Constraint satisfaction with an object-oriented knowledge representation language, Investigating production system representations for non-combinatorial match, Portfolio approaches for constraint optimization problems, Experimental evaluation of preprocessing algorithms for constraint satisfaction problems, Problem solving by searching for models with a theorem prover, Local consistency in parallel constraint satisfaction networks, Partitioning graph matching with constraints, Using dialog-controlled rule systems in a maintenance module for knowledge bases, A conservative scheme for parallel interval narrowing, Filtering algorithms for the multiset ordering constraint, Safe starting regions by fixed points and tightening, Solving connected row convex constraints by variable elimination, Image interpretation with a conceptual graph: labeling over-segmented images and detection of unexpected objects, Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects, Undirected forest constraints, On topological consistency and realization, Symmetry breaking constraints for value symmetries in constraint satisfaction, Constraint propagation with interval labels, Network-based heuristics for constraint-satisfaction problems, Constraint satisfaction from a deductive viewpoint, Parallel consistent labeling algorithms, Some fundamental properties of local constraint propagation, Modularity-based decompositions for valued CSP, Spatial reasoning with rectangular cardinal relations. The convex tractable subalgebra, The transformational creativity hypothesis, Recognition mechanisms for schema-based knowledge representations, Constraint propagation as information maximization, Branch \& Sample: A simple strategy for constraint satisfaction, Dualities and dual pairs in Heyting algebras, An optimal k-consistency algorithm, Algorithms for partition of some class of graphs under compaction and vertex-compaction, Redundant modeling in permutation weighted constraint satisfaction problems, Localized planning with action-based constraints, No more ``Partial and ``Full Looking Ahead, Planning parallel actions, Qualitative reasoning with directional relations, Relational consistency algorithms and their application in finding subgraph and graph isomorphisms, A condensed semantics for qualitative spatial reasoning about oriented straight line segments, Qualitative reasoning about relative direction of oriented points, \textsc{NeVer}: a tool for artificial neural networks verification, On getting rid of the preprocessing minimization step in MUC-finding algorithms, Adaptive constructive interval disjunction: algorithms and experiments, STR2: optimized simple tabular reduction for table constraints, Decomposing a relation into a tree of binary relations, Fuzzy reasoning in a multidimensional space of hypotheses, A logic language for combinatorial optimization, A survey of constraint-based programming paradigms, Comments on Mohr and Henderson's path consistency algorithm, A hybrid soft computing approach for subset problems, The island confinement method for reducing search space in local search methods, New algorithms for bidirectional singleton arc consistency, A unified theory of structural tractability for constraint satisfaction problems, Formula dissection: A parallel algorithm for constraint satisfaction, Multiset variable representations and constraint propagation, Domain consistency with forbidden values, Temporal constraint networks, A reinforcement learning approach to interval constraint propagation, Reverse propagation of McCormick relaxations, A constraint propagation approach to structural model based image segmentation and recognition, Interval propagation to reason about sets: Definition and implementation of a practical language, From local to global consistency, A generic arc-consistency algorithm and its specializations, Scheduling with neural networks -- the case of the Hubble Space Telescope, Parsing as non-Horn deduction, Processing natural language with schema constraint networks, The logic of constraint satisfaction, Constraint satisfaction using constraint logic programming, Reasoning about qualitative temporal information, A branch and bound algorithm for numerical Max-CSP, Computing the minimal relations in point-based qualitative temporal reasoning through metagraph closure, Qualitative simulation, Arc consistency for factorable relations., Approximated consistency for the automatic recording constraint, \(H\)-coloring degree-bounded (acyclic) digraphs, Affine systems of equations and counting infinitary logic, Forward checking and intelligent backtracking, A computational study of constraint satisfaction for multiple capacitated job shop scheduling, The job shop scheduling problem: Conventional and new solution techniques, Efficient handling of universally quantified inequalities, Reduction operations for constraint satisfaction, Constraints, consistency and closure, A gentle introduction to Numerica, A spectrum of compromise aggregation operators for multi-attribute decision making, Random constraint satisfaction: easy generation of hard (satisfiable) instances, Using constraint metaknowledge to reduce arc consistency computation, Enhancing numerical constraint propagation using multiple inclusion representations, Interval propagation and search on directed acyclic graphs for numerical constraint solving, Peek arc consistency, Computing improved optimal solutions to max-min flexible constraint satisfaction problems, Simulation of hybrid circuits in constraint logic programming, Decomposing constraint satisfaction problems using database techniques, Characterising tractable constraints, Arc-consistency for continuous variables, Hybrid backtracking bounded by tree-decomposition of constraint networks, A fuzzy constraint based model for bilateral, multi-issue negotiations in semi-competitive environments, Fuzzy constraint networks for signal pattern recognition, Solving weighted CSP by maintaining arc consistency, Optimization in temporal qualitative constraint networks, Reduction operations in fuzzy or valued constraint satisfaction, Binary vs. non-binary constraints, On point-duration networks for temporal reasoning, Solving multi-granularity temporal constraint networks, Disjunctions, independence, refinements, ECLⁱPS^e – From LP to CLP, Partition search for non-binary constraint satisfaction, An optimal backtrack algorithm for tree-structured constraint satisfaction problems, Model-based inference in CHARME., Constraint Solving for Verifying Modal Specifications of Workflow Nets with Data, A hypergraph model for constraint logic programming and applications to bus drivers' scheduling, On the parallel complexity of discrete relaxation in constraint satisfaction networks, The combinatorics of object recognition in cluttered environments using constrained search, Constraint relaxation may be perfect, Interactive scheduling as a constraint satisfiability problem, Theoretical analysis of singleton arc consistency and its extensions, Domain filtering consistencies for non-binary constraints, Complexity results and algorithms for possibilistic influence diagrams, Domain permutation reduction for constraint satisfaction problems, Properties of tree convex constraints, Modelling and solving temporal reasoning as propositional satisfiability, Refinements of the maximum approach to decision-making in a fuzzy environment, SUNNY: a Lazy Portfolio Approach for Constraint Solving, On the speed of constraint propagation and the time complexity of arc consistency testing, Thick set inversion, \(T\)-choosability in graphs, Towards breaking more composition symmetries in partial symmetry breaking, The fixed point property for ordered sets, Qualitative representation of positional information, \textit{Helios}: A modeling language for global optimization and its implementation in \textit{Newton}, Solving linear, min and max constraint systems using CLP based on relational interval arithmetic, Local and global relational consistency, The complexity of constraint satisfaction revisited, Combining qualitative and quantitative constraints in temporal reasoning, Abstracting soft constraints: framework, properties, examples, On tree-preserving constraints, Bracketing the solutions of an ordinary differential equation with uncertain initial conditions, Enhancing interval constraint propagation by identifying and filtering \(n\)-ary subsystems, A Dempster-Shafer approach for recognizing machine features from CAD models, Twenty-one large tractable subclasses of Allen's algebra, Constraint satisfaction problem with bilevel constraint: Application to interpretation of over-segmented images, Fundamental properties of neighbourhood substitution in constraint satisfaction problems, Revisiting restricted path consistency, Efficient algorithms for singleton arc consistency, A machine learning method to reveal closed sets of common features of objects using constraint programming, A multiagent evolutionary algorithm with direct and indirect combined representation for constraint satisfaction problems, The graphs behind reuleaux polyhedra, The essence of constraint propagation, Connections between default reasoning and partial constraint satisfaction, Polynomial algorithm of limited propositional deduction, On the arc consistency problem, Propagation algorithms for lexicographic ordering constraints, Incremental qualitative temporal reasoning: Algorithms for the point algebra and the ORD-Horn class, An optimal coarse-grained arc consistency algorithm, Asynchronous aggregation and consistency in distributed constraint satisfaction, Constraint-based reasoning and privacy/efficiency tradeoffs in multi-agent problem solving, Automatic generation of redundant models for permutation constraint satisfaction problems, Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics, Model-based computing: Developing flexible machine control software, Enhanced multiple-point statistical simulation with backtracking, forward checking and conflict-directed backjumping, Constructive generation of very hard 3-colorability instances, MiniCP: a lightweight solver for constraint programming, Solving the minimum-weighted coloring problem, Enhancing set constraint solvers with lexicographic bounds, A constraint programming-based approach to the crew scheduling problem of the Taipei mass rapid transit system, A hybrid setup for a hybrid scenario: combining heuristics for the home health care problem, Constraint solving for proof planning, Combinatorial problems raised from 2-semilattices, A new tractable class of constraint satisfaction problems, Relation algebras and their application in temporal and spatial reasoning, The Arthur Prior memorial conference, Christchurch, 1989, Reliable nonlinear state estimation involving time uncertainties, Resource-constrained project scheduling: Notation, classification, models, and methods, Obtaining solutions in fuzzy constraint networks, Branching interval algebra: an almost complete picture, Evolution of Region Connection Calculus to VRCC-3D+, Constraint satisfaction problems: Algorithms and applications, Prioritised fuzzy constraint satisfaction problems: Axioms, instantiation and validation, Tesseral spatio-temporal reasoning for multi-dimensional data, Optimization of a recursive conveyor by reduction to a constraint satisfaction problem, On-line algorithms for networks of temporal constraints, Timetable planning using the constraint-based reasoning, A new branch-and-filter exact algorithm for binary constraint satisfaction problems, Backtracking algorithms for disjunctions of temporal constraints, Organizing a social event --- A difficult problem of combinatorial optimization, Multi-agent path finding with mutex propagation, On a new extension of BTP for binary CSPs, From MDD to BDD and arc consistency, A new approach to cyclic ordering of 2D orientations using ternary relation algebras, Constraint propagation techniques for the disjunctive scheduling problem, A Lagrangian reconstruction of GENET, STR3: a path-optimal filtering algorithm for table constraints, View-based propagator derivation, Propagation engine prototyping with a domain specific language, Combining topological and size information for spatial reasoning, Backjump-based backtracking for constraint satisfaction problems, Commutative idempotent groupoids and the constraint satisfaction problem., An algorithm-independent measure of progress for linear constraint propagation, Local search with constraint propagation and conflict-based heuristics, Accelerating filtering techniques for numeric CSPs, CLAP: A New Algorithm for Promise CSPs, Iterative coloring extension of a maximum clique, A Global Filtration for Satisfying Goals in Mutual Exclusion Networks, From chaotic iteration to constraint propagation, Underconstrained knowledge-intensive constraint satisfaction search, Revision in ACMS, Propositional calculus problems in CHIP, Path consistency in clp(FD), An iterative time‐bucket refinement algorithm for a high‐resolution resource‐constrained project scheduling problem, The smallest hard trees, Automatic generation of dominance breaking nogoods for a class of constraint optimization problems, An algebraic characterization of tractable constraints, Maximum feasibility estimation, Path Consistency by Dual Consistency, Une procédure de décision pour un problème de satisfiabilité dans un univers ensembliste héréditairement fini, Object-oriented constraint logic programming for timetable planning, A fine-grained arc-consistency algorithm for non-normalized constraint satisfaction problems, A REVIEW OF TREE CONVEX SETS TEST, Interval constraint propagation with application to bounded-error estimation, Unnamed Item, Dynamic algorithms for classes of constraint satisfaction problems, Unnamed Item, Computational complexity relationship between compaction, vertex-compaction, and retraction, Learning solution preferences in constraint problems, A probabilistic approach to solving crossword puzzles, Multi-agent oriented constraint satisfaction, Tractable constraints on ordered domains, Tractable constraints on ordered domains, Three perspectives for solving the job grouping problem, Constraint Satisfaction, Bracketing backward reach sets of a dynamical system, Consistency checking within local search applied to the frequency assignment with polarization problem, Dynamic Analysis of Bounds Versus Domain Propagation, The Power of Linear Programming for General-Valued CSPs, Short term scheduling and control in the batch process industry using hybrid knowledge based simulation

Uses Software

Algorithm 97

Cites Work

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1231783&oldid=13310417"