Synthesizing constraint expressions

DOI10.1145/359642.359654zbMath0386.68065OpenAlexW2072755230MaRDI QIDQ4167597

Publication date: 1978

Published in: Communications of the ACM (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1721.1/6247

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Discrete mathematics in relation to computer science (68R99)

Related Items

Reduction operations in fuzzy or valued constraint satisfaction, Experimental evaluation of preprocessing algorithms for constraint satisfaction problems, Problem solving by searching for models with a theorem prover, Improving the efficiency of a hyperlinking-based theorem prover by incremental evaluation with network structures, CoLab: A hybrid knowledge representation and compilation laboratory, Constraint propagation with interval labels, The combinatorics of object recognition in cluttered environments using constrained search, Constraint relaxation may be perfect, Interactive scheduling as a constraint satisfiability problem, Some fundamental properties of local constraint propagation, Theoretical analysis of singleton arc consistency and its extensions, Properties of tree convex constraints, Modelling and solving temporal reasoning as propositional satisfiability, Tree clustering for constraint networks, An optimal k-consistency algorithm, Revisiting global constraint satisfaction, Implicates and prime implicates in random 3-SAT, From local to global consistency in temporal constraint networks, Local and global relational consistency, On tree-preserving constraints, Fundamental properties of neighbourhood substitution in constraint satisfaction problems, A logic language for combinatorial optimization, Constraint-based reasoning and privacy/efficiency tradeoffs in multi-agent problem solving, Temporal constraint networks, Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics, Constraint satisfaction -- algorithms and complexity analysis, On the CSP Dichotomy Conjecture, From local to global consistency, A REVIEW OF TREE CONVEX SETS TEST, A generic arc-consistency algorithm and its specializations, Reasoning about qualitative temporal information, Dynamic algorithms for classes of constraint satisfaction problems, Interpolation coding: A representation for numbers in neural models, Learning solution preferences in constraint problems, Handling contingency in temporal constraint networks: from consistency to controllabilities, Reasoning about cardinal directions between extended objects, Tractable disjunctions of linear constraints: Basic results and applications to temporal reasoning, Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis, A constraint programming primer, Using constraint metaknowledge to reduce arc consistency computation, Local consistency for extended CSPs, Backtracking algorithms for disjunctions of temporal constraints, RECONSTRUCTABILITY ANALYSIS: Overview and Bibliography†, A new approach to cyclic ordering of 2D orientations using ternary relation algebras, Constraint propagation techniques for the disjunctive scheduling problem, A Logical Approach to Constraint Satisfaction, The Power of Linear Programming for General-Valued CSPs, Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey, Backjump-based backtracking for constraint satisfaction problems, Accelerating filtering techniques for numeric CSPs, Compiling constraint satisfaction problems, Decomposing constraint satisfaction problems using database techniques