Product
Patsnap Eureka
For R&D, Patsnap Eureka makes reading and utilizing patents & technical documents easy.
Patsnap Eureka AIR
Designed for self-driven R&D workflows. Generate viable solutions, solve complex R&D challenges, empower your innovation with AI.
Patsnap Eureka Materials
Designed for material experts only. Revolutionize your material R&D, from search, analyze, to developing new materials.
Feature
TechResearch
Generate reliable direction feasibility study reports for your R&D in just a few steps.
TechSeek
Discover and master advanced knowledge NOW. Basics, ideas, possibilities, all at once.
TechMind
As an expert in R&D Theories, TechMind can generates customized viable solutions instantly.
TechRisk
Analyze your overall solution with one click, know your potential R&D risks in advance.
TechMonitor
Get weekly tech updates, stay abreast of the latest tech innovations and key insights.
Patents
Literature
Hiro is an intelligent assistant for R&D personnel, combined with Patent DNA, to facilitate innovative research.
94 results about "Constraint satisfaction problem" patented technology
Efficacy Topic
Property
Owner
Technical Advancement
Application Domain
Technology Topic
Technology Field Word
Patent Country/Region
Patent Type
Patent Status
Application Year
Inventor
Constraint satisfaction problems (CSPs) are mathematical questions defined as a set of objects whose state must satisfy a number of constraints or limitations. CSPs represent the entities in a problem as a homogeneous collection of finite constraints over variables, which is solved by constraint satisfaction methods. CSPs are the subject of intense research in both artificial intelligence and operations research, since the regularity in their formulation provides a common basis to analyze and solve problems of many seemingly unrelated families. CSPs often exhibit high complexity, requiring a combination of heuristics and combinatorial search methods to be solved in a reasonable time. Constraint Programming (CP) is the field of research that specifically focuses on tackling with this kind of problems. Additionally, boolean satisfiability problem (SAT), the satisfiability modulo theories (SMT), mixed integer programming (MIP) and answer set programming (ASP) are all fields of research focusing on the resolution of particular forms of the constraint satisfaction problem.
Service management system for use in communications
InactiveUS6445782B1Efficient switchingTime-consume taskSpecial service for subscribersSelection arrangementsConstraint satisfaction problemEngineering
A feature checker provides the ability to review communications service features for interaction problems at service creation time, or at runtime. Hence a feature can be reviewed against existing service features or against a specific other user's features.The feature checker is based on modelling communications service features as constraint satisfaction problems in which constraints 600, 605 determine preset relationships between values 610, 615 for variables 200, 215, 300, 400 of the feature. The model can then be searched for inconsistencies which indicate feature interaction. Interaction can be solved by building in an "alternative invoke" 610 for a feature which overcomes the inconsistency. This might be for instance a form of invoke which, when instantiated, actively suppresses a conflicting feature.
Owner:BRITISH TELECOMM PLC
Method for constraint-based document generation
ActiveUS7107525B2Digital computer detailsMultiprogramming arrangementsConstraint satisfaction problemAs element
Owner:GOOGLE LLC
System for solving of a constraint-satisfaction problem and constructing of a system
A system and method for processing a large constraint satisfaction problem quickly, including a subset generating module (1), which divides a set of alternatives provided for a plurality of parts of a given problem into a plurality of subsets, such that each subset has not more than two alternatives for each part. For each subset generated by the division, a solution calculation module (2) finds a solution by calculating combinations of alternatives satisfying a constraint between alternatives selected for each two parts. The calculation of a solution for a subset, such that each subset has not more than two alternatives for each part, requires a very short period of processing time, even if the parts are many. Thus, the sum of the times required for finding a solution for all the subsets is much shorter than the time required for finding a solution for the original problem without such processing.
Owner:KK TOSHIBA
Markovian-sequence generator and new methods of generating markovian sequences
ActiveUS20110010321A1Extensive controlMore “costly”Mathematical modelsElectrophonic musical instrumentsConstraint satisfaction problemExecution control
A new type of Markovian sequence generator and generation method generates a Markovian sequence having controllable properties, notably properties that satisfy at least one control criterion which is a computable requirement holding on items in the sequence. The Markovian sequence is generated chunkwise, each chunk containing a plurality of items in the sequence. During generation of each chunk a search is performed in the space of Markovian sequences to find a chunk-sized series of items which enables the control criterion to be satisfied. The search can be performed using a generate and test approach in which chunk-sized Markovian sequences are generated then tested for compliance with the requirement(s) of the control criteria. Alternatively, the search can be performed by formulating the sequence-generation task as a constraint satisfaction problem, with one or more constraints ensuring that the generated sequence is Markovian and one or more constraints enforcing the requirement(s) of the control criteria. The sequence generator can be used in an interactive system where a user specifies the control criterion via an inputting device (20).
Owner:SONY CORP
System and method for constraint-based document generation
ActiveUS7010746B2Digital computer detailsMultiprogramming arrangementsConstraint satisfaction problemAs element
What is disclosed is a system and method for specifying a custom document as a constraint satisfaction problem (CSP) to create the specified document using existing constraint solving algorithms wherein the document, its content components, and its layout requirements as elements of a constraint satisfaction problem which when solved, results in an automated document layout for the set of content components. This enables an easier (i.e., automated) custom document creation process while providing a wider array of output documents.
Owner:GOOGLE LLC
Modeling language and method for address translation design mechanisms in test generation
InactiveUS20050278702A1Large coverageLogical operation testingSoftware simulation/interpretation/emulationConstraint satisfaction problemModeling language
Methods and systems are disclosed that enhance the ability of a test generator to automatically deal with address translation in a processor design, and without need for creating specific code. A model of the address translation mechanism of a design-under-test is represented as a directed acyclic graph and then converted into a constraint satisfaction problem. The problem is solved by a CSP engine, and the solution used to generate test cases for execution. Using the model, testing knowledge can be propagated to models applicable to many different designs to produce extensive coverage of address translation mechanisms.
Owner:GLOBALFOUNDRIES INC
Reformulation of constraint satisfaction problems for stochastic search
InactiveUS20070005534A1Low densityRemove constraintsDigital computer detailsDigital dataConstraint satisfaction problemComputer science
A computer-implemented method for solving a constraint satisfaction problem (CSP), which is defined by variables and constraints applicable to the variables, and which has states corresponding to respective sets of values of the variables. The method includes assigning cost functions to the constraints so that the states have respective costs determined by application of the cost functions to the respective sets of values of the variables, the respective costs defining a problem topography of the CSP having global extrema corresponding to solutions of the CSP. The constraints of the CSP are reformulated so as to perform at least one of increasing a density of the solutions in the problem topography and smoothing a gradient of the problem topography. One or more of the solutions of the CSP are found by applying a stochastic CSP solver to the reformulated constraints.
Owner:IBM CORP
Sequence generation using a constraint satisfaction problem formulation
InactiveUS6430573B1Data processing applicationsElectronic editing digitised analogue information signalsConstraint satisfaction problemDatabase
A method and system for automatic generation of sequences (notably temporal or spatial sequences) from items in a database involves the organisation of the data in a generic format, and the formulation of the problem as a Constraint Satisfaction Problem using special constraint classes. The database format includes attribute values referring to a predetermined taxonomy allowing similarity and difference between the respective values to be evaluated. The special constraint classes include the classes of cardinality constraints (which allow it to be specified that the number of items whose attribute belongs to a given set is within a particular range, and / or that the number of values of an attribute is within a specified range), similarity or dissimilarity constraints (which allow it to be specified that successive items must be similar or different from each other) and global difference constraints (which allow it to be specified that the respective values of a given attribute for all items in a range must be different from each other).
Owner:SONY FRANCE
Accelerated solution of constraint satisfaction problems by partitioning of the variable space
InactiveUS20050222827A1Big impactComputer controlSimulator controlConstraint satisfaction problemGoal system
Methods, systems and apparatus for modeling a target system includes defining a constraint satisfaction problem (CSP) that characterizes the target system in terms of a set of variables, each having a respective input domain, and initial constraints applicable to the variables. The variables are partitioned into at least first and second sets. An abstract solution is found to the CSP, including a given assignment of the variables in the first set. A reduced domain of at least one of the variables in the second set is computed, so as to be compatible with the abstract solution. A redundant constraint on the abstract solution is determined responsively to the reduced domain. A concrete solution to the CSP is then found, using the abstract solution and the redundant constraint.
Owner:IBM CORP
Solutions for constraint satisfaction problems requiring multiple constraints
InactiveUS20050010922A1Genetic modelsDigital computer detailsConstraint satisfaction problemData mining
Owner:INTEL CORP
Modeling language and method for address translation design mechanisms in test generation
InactiveUS7370296B2Large coverageLogical operation testingSoftware simulation/interpretation/emulationConstraint satisfaction problemTheoretical computer science
Owner:GLOBALFOUNDRIES INC
Solving constraint satisfiability problem for circuit designs
InactiveUS7073143B1Computer aided designSoftware simulation/interpretation/emulationConstraint satisfaction problemNumbering system
A method for generating a test vector for functional verification of circuits includes providing a representation of a circuit, where the representation includes a control logic component and a datapath logic component. The method also includes reading one or more vector generation targets, and performing word-level ATPG justification on the control logic component to obtain a control logic solution. The method further includes extracting one or more arithmetic functions for the datapath logic component based on the control logic solution, and solving the one or more arithmetic functions using a modular constraint solver. The modular constraint solver is based on a modular number system.
Owner:CADENCE DESIGN SYST INC
Accelerated solution of constraint satisfaction problems by partitioning of the variable space
InactiveUS7409377B2Computer controlSimulator controlConstraint satisfaction problemTheoretical computer science
Owner:INT BUSINESS MASCH CORP
Method and apparatus for generating test scenarios for a set of business rules
InactiveUS20150178625A1Knowledge representationResourcesConstraint satisfaction problemComputerized system
A method for automatically generating test scenarios for a plurality of business rules created to form a ruleset for a business domain. A plurality of decision variables is extracted from a business object model associated with the business domain using a computer system. The plurality of business rules is parsed using a syntactic parser operating on the computer system to extract at least one condition expression and an assignment action. A collection of mutually exclusive constraint satisfaction problems is built from the decision variables, condition expressions, and assignment actions using a constraint problem generator operating on the computer system. A plurality of test scenarios is generated automatically from each identified constraint satisfaction problem in the collection using a constraint solver engine operating on the computer system.
Owner:IBM CORP
NoGood Generation Based on Search Tree Depth
ActiveUS20130191317A1Efficient solutionKnowledge representationSpecial data processing applicationsConstraint satisfaction problemBinary tree
A constraint satisfaction problem (CSP) is used to model a real-world problem in an application domain. The CSP includes a plurality of variables, a plurality of states, and one or more constraints determining which states each variable is permitted to be assigned to in a solution to the CSP. A binary tree is created using the CSP. The binary tree is iteratively searched to determine an efficient solution to the CSP. A new iteration of the search of the binary tree is started when a search depth is less than a restart depth. The restart depth based on a deepest depth previously searched minus a restart value. When the search is restarted, a NoGood marker is created indicating a portion of the binary tree that is not to be searched in the new iteration of the search. An efficient solution to the CSP is reported.
Owner:GOOGLE LLC
Hyper-arc consistency in a contraint satisfaction network
InactiveUS7085748B2Reduce investmentDigital computer detailsComputation using non-denominational number representationConstraint satisfaction problemConstraint satisfaction
A method for solving a constraint satisfaction problem includes receiving a set of variables having respective input domains and a set of relations among the variables, and building a network of one or more hyper-arcs representative of the set of relations, each hyper-arc corresponding to one of the relations and linking nodes in the network corresponding to the variables that are subject to the relation. For each of the hyper-arcs, the variables are assembled in a hierarchy based on the relation corresponding to the hyper-arc. The input domains of the variables in the hierarchy are reduced, so as to determine respective output domains of the variables that are consistent with the relations.
Owner:IBM CORP
Constraint-optimization method for document layout using tradeoff generation
InactiveUS20070006072A1Natural language data processingSpecial data processing applicationsConstraint satisfaction problemComputer science
A method for automated document layout using interactive tradeoff generation during the optimization of a constraint satisfaction problem (CSP) is provided. The method includes generating a constraint satisfaction problem describing the layout of the items in the document as a problem having constraints, finding inconsistent constraints which are incapable of being satisfied together, generating tradeoffs for the inconsistent constraints capable of eliminating one or more of the inconsistent constraints, choosing one or more of the tradeoffs as being one or more acceptable tradeoffs and using them to optimize the CSP to arrive at an optimized document layout.
Owner:XEROX CORP
Management of sub-problems in a dynamic constraint satisfaction problem solver
ActiveUS8065255B2Knowledge representationInference methodsConstraint satisfaction problemProblem set
Owner:ORACLE INT CORP
Solving constraint satisfiability problem for automatic generation of design verification vectors
InactiveUS7797648B1Computer aided designSoftware simulation/interpretation/emulationConstraint satisfaction problemNumbering system
A method for generating a test vector for functional verification of circuits includes providing a representation of a circuit, where the representation includes a control logic component and a datapath logic component. The method also includes reading one or more vector generation targets, and performing word-level ATPG justification on the control logic component to obtain a control logic solution. The method further includes extracting one or more arithmetic functions for the datapath logic component based on the control logic solution, and solving the one or more arithmetic functions using a modular constraint solver. The modular constraint solver is based on a modular number system.
Owner:CADENCE DESIGN SYST INC
Constraint satisfaction problem solver with interactive conflict resolution
ActiveUS8751425B2Digital computer detailsForecastingConstraint satisfaction problemTheoretical computer science
Owner:ORACLE INT CORP
PPI network comparison-oriented graph matching constraint solving symbol method
ActiveCN107704578AReduce complexityImprove solution efficiencyBiostatisticsProteomicsConstraint satisfaction problemGraph match
The invention discloses a PPI network comparison-oriented graph matching constraint solving symbol method. According to the method, a CSP model is established (a constraint condition with a shortest path is established) by utilizing a constraint relationship in a graph structure; by adoption of a graph-based backtracking algorithm, an OBDD symbol technology and each included symbol operation, theaim of solving subgraph isomorphism problems is achieved; and finally, the technology is imported in to a PPI network comparison problem, the problem is solved and a PPI network comparison-oriented graph matching constraint solving symbol technology is given. According to the method, the graph-based backtracking algorithm which is used for solving constraint satisfaction problems is combined, theOBDD symbol technology is adopted, advantages of an operation method are developed, and a graph matching symbol algorithm is applied to the protein mutual action network comparison problems in the field of biological information according to a constraint symbol solving technology which is used for solving sub-graph isomorphism, so that the problem solving efficiency can be improved to a certain extent and the state space complexity is reduced.
Owner:GUILIN UNIV OF ELECTRONIC TECH
System and method for overcoming infeasibility determinations in using constraint satisfaction programming for scheduling human resources
InactiveUS20070027739A1Digital computer detailsResourcesConstraint satisfaction problemComputer science
A system and method are disclosed for allocating human resources to tasks using constraint satisfaction programming, where fictitious persons are used to satisfy required constraints, to ensure that the solution process continues until a solution is found, and capability constraints and job constraints are relaxed until a solution is found. Tasks using fictitious persons are identified, and information about task capability requirements not met and capabilities of unallocated human resources are displayed so that constraints may be relaxed and fictitious persons removed. There is provision for handling multi-task jobs where if a fictitious person is assigned to any task then all tasks will be assigned a fictitious person.
Owner:IBM CORP
Method for generating an explanation of a CSP solution
InactiveUS7523445B1Complex to developHand manipulated computer devicesDigital computer detailsConstraint satisfaction problemTheoretical computer science
The invention provides a computer-implemented method for generating a solution to a constraint satisfaction problem (CSP). The method operates to implement various steps that include defining the CSP problem by a set of variable having finite domains, and constraints defined over the variables, solving the CSP by assigning values to said variables that are consistent with the constraints and debugging the CSP solution. The debugging of the CSP solution is carried out by iteratively executing a propagator to reduce the variable domain. Augmenting the constraints is carried out to supply an explanation for particular values assigned to the variables, and constraints defined over the variable utilized in the solution.
Owner:IBM CORP
Configuration assistance for complex products
ActiveUS20070094175A1Efficient and highly user-friendly aiding toolOptimal configuration of an artifact can be found very efficientlyDigital computer detailsDigital dataConstraint satisfaction problemModel translation
Disclosed are interactive computer-implemented support solutions for facilitating the configuration of complex artifacts having characteristics that vary over a relatively wide range of possibilities. The artifact is defined by a configuration model and its features are described by a set of interrelated parameters. A model translation module converts the configuration model into a constraint satisfaction problem. The constraint satisfaction problem, in turn, is defined by a set of variables, wherein each variable may attain a finite number of different values, and a set of constraints restricting which variable values that are simultaneously possible for the variables in the set of variables. A configuration engine calculates a solution to the constraint satisfaction problem, which is optimal with respect to a value assigned to each variable in the constraint satisfaction problem relative to a predefined optimizing criterion. The configuration engine also derives a set of optimal parameter values associated with the calculated solution.
Owner:TACTON SYST
Intelligent design and evaluation method for flight control actuation system of large aircraft
InactiveCN108984917ANarrowing down the set of configurationsRealize solution set solutionGeometric CADSpecial data processing applicationsConstraint satisfaction problemIntelligent design
An intelligent design and evaluation method for a flight control actuation system of a large aircraft includes the steps of reducing a configuration set of a flight control actuation system by an artificial intelligence method based on a constraint satisfaction problem according to a constraint condition; according to the safety requirements of the flight control actuation system, eliminating theconfiguration that does not meet the requirements; establishing an evaluation method of a flight control actuation system optimization index; according to the objective function constructed by the evaluation method, carrying out the multi-objective optimization of flight control actuation system, and obtaining a Pareto optimization set to make the configuration set shrink further; carrying out decision analysis for the Pareto optimization set to determine the target configuration of the flight control actuation system.
Owner:BEIHANG UNIV
Labelling entities in a canonical data model
ActiveUS9785658B2Digital data information retrievalSpecial data processing applicationsConstraint satisfaction problemSolver
Enterprises express the concepts of their electronic business-to-business (B2B) communication in differently structured ontology-like schemas. Collaborations benefit from merging the common concepts into semantically unique Business Entities (BEs) in a merged schema. Methods and systems for labeling the merged schema with descriptive, yet short and unique names, are described. A heuristically ranked list of descriptive candidate phrases for each BE is derived locally from the names and descriptions of the underlying concepts. A semantically unique candidate phrase is assigned to each BE that discriminates it from the other BEs by employing a constraint satisfaction problem solver.
Owner:SAP AG
Dynamic constraint satisfaction problem solver
ActiveUS20100121795A1Digital computer detailsDigital dataConstraint satisfaction problemNetwork variable
A system for solving a dynamic constraint satisfaction problem comprises a constraint network of variables and constraints. The system creates a first sub-problem model that includes a first model type, one or more first variables and zero or more first constraints. The system propagates the first constraints through the constraint network and determines if a first conflict is detected from propagating the first constraints. If the first conflict is detected, the system restores the constraint network variables to a first previous state before the first constraints were propagated. The system creates a first sub-problem set that includes a second model type and one or more sub-problem models. The system connects the first sub-problem model to the first sub-problem set via a second constraint and propagates the second constraint through the constraint network.
Owner:ORACLE INT CORP
Dynamic constraint satisfaction problem solver
ActiveUS8504501B2Digital computer detailsDigital dataConstraint satisfaction problemNetwork variable
Owner:ORACLE INT CORP
Dynamic constraint satisfaction problem solver with inferred problem association removal
A constraint solver for solving a constraint satisfaction problem network that comprises a plurality of nodes and a plurality of constraints. The solver receives a request to remove an inferred problem association and determines one or more user decisions that triggered the inferred problem association.
Owner:ORACLE INT CORP
Who we serve
- R&D Engineer
- R&D Manager
- IP Professional
Why Patsnap Eureka
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com