CN116340695A - Solving method, device, equipment and storage medium for limiting theoretical model - Google Patents
Solving method, device, equipment and storage medium for limiting theoretical model Download PDFInfo
- Publication number
- CN116340695A CN116340695A CN202310113809.4A CN202310113809A CN116340695A CN 116340695 A CN116340695 A CN 116340695A CN 202310113809 A CN202310113809 A CN 202310113809A CN 116340695 A CN116340695 A CN 116340695A
- Authority
- CN
- China
- Prior art keywords
- model
- constraint
- subset
- theoretical model
- atoms
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 46
- 238000010276 construction Methods 0.000 claims description 13
- 238000004364 calculation method Methods 0.000 abstract description 6
- 230000006870 function Effects 0.000 description 11
- 238000004891 communication Methods 0.000 description 7
- 238000010586 diagram Methods 0.000 description 6
- 238000012545 processing Methods 0.000 description 4
- 230000008878 coupling Effects 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 238000001514 detection method Methods 0.000 description 3
- 230000008569 process Effects 0.000 description 3
- 230000005540 biological transmission Effects 0.000 description 2
- 238000006243 chemical reaction Methods 0.000 description 2
- 238000013461 design Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 239000004973 liquid crystal related substance Substances 0.000 description 2
- 230000007774 longterm Effects 0.000 description 2
- 230000005236 sound signal Effects 0.000 description 2
- 230000001133 acceleration Effects 0.000 description 1
- 230000001419 dependent effect Effects 0.000 description 1
- 238000003745 diagnosis Methods 0.000 description 1
- 238000007599 discharging Methods 0.000 description 1
- 230000005484 gravity Effects 0.000 description 1
- 238000010295 mobile communication Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012544 monitoring process Methods 0.000 description 1
- 230000003121 nonmonotonic effect Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 238000010897 surface acoustic wave method Methods 0.000 description 1
- 230000000007 visual effect Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/10—Complex mathematical operations
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Mathematical Physics (AREA)
- Data Mining & Analysis (AREA)
- General Physics & Mathematics (AREA)
- Mathematical Analysis (AREA)
- Mathematical Optimization (AREA)
- Computational Mathematics (AREA)
- Pure & Applied Mathematics (AREA)
- Databases & Information Systems (AREA)
- Software Systems (AREA)
- General Engineering & Computer Science (AREA)
- Algebra (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The application discloses a method, a device, equipment and a storage medium for solving a constraint theoretical model, which are based on a satisfied model, find out that the interpretation of atoms in a fixed atomic set is less true atoms in a tiny primitive subset P under the condition of keeping the interpretation of the atoms in the fixed atomic set unchanged, and satisfy a theory clause set A, and gradually approach the solution model to the constraint theoretical model in an iterative manner according to the definition of the constraint theoretical model, thereby solving the technical problems that the number worst case of a ring formula in the prior art may reach an index level and the existence of a term needs to be eliminated in calculation.
Description
Technical Field
The present disclosure relates to the field of solution technologies for limiting theoretical models, and in particular, to a solution method, device, equipment and storage medium for limiting theoretical models.
Background
The theory of restriction (circumscribing) is a non-monotonic logic proposed by John McCarthy, and its research and application in formalization of common sense knowledge and diagnosis have received attention from many scholars. Three parameters are generally required in solving the constraint theoretical model: A. p, Z where A is a clause set, P and Z are disjoint atom sets, P is referred to as a minimized atom set, Z is referred to as a variable atom set, and nothing in P and Z is referred to as a fixed primitive subset.
The constraint that the minimisation primitive subset P has a variable primitive subset Z on equation a is denoted CIRC [ a; p is as follows; z is Z]. If the original subset M is CIRC [ A; p is as follows; z is Z]Then there is no model M' of A, such that
And M' - (P u Z) =m- (P u Z).
The current constraint theoretical model solution has two main routes. One is to convert the constraint theory to an answer set program and solve it using an answer set program solver, for example, janhunen and okarinen developed in 2004 a tool circ2dlp that converts the constraint theory to a disjunctive logic program, and 2014 wan hai et al proposed a linear program cfo2lp that converts the first order constraint theory to a logic program on an arbitrary structure under steady model semantics.
However, the existing solver circ2dlp and cfo2lp have a common problem that the solved model is built on a stable language model instead of a satisfactory model, so that the technical problem of incomplete calculated constraint theoretical model exists; meanwhile, in many cases, the SAT solver-based algorithm performs better than the answer set solver in solving the same problem.
On the basis of the constraint theory solution of the satisfaction model, the ring formulas proposed by Lee and Lin et al mainly have two problems: firstly, the worst case number of ring formulas may reach an exponential level, and secondly, the existing adjectives need to be eliminated in calculation. There is currently no constraint theory solver based on a model that can be satisfied.
Disclosure of Invention
The application provides a solving method, a device, equipment and a storage medium for limiting a theoretical model, which solve the technical problems that the number of ring formulas in the prior art can reach an exponential level in the worst case, and the existence of a graduated word needs to be eliminated in calculation.
In view of this, a first aspect of the present application provides a solution method for limiting a theoretical model, the method comprising:
s1, initializing a parameter A, P, Z, wherein A is a clause set, P is a very small primitive subset, Z is a variable atom set, P and Z are disjoint primitive subsets, one of P and Z is not a fixed primitive subset, and the limitation that the very small primitive subset P has the variable primitive subset Z on the clause set A is recorded as CIRC [ A; p is as follows; z, the atom set M is CIRC [ A ]; p is as follows; z ] and is a model for calculating clause set A.
S2, constructing a first set T, wherein atoms in the tiny primitive subset P which are limited by the first set T are interpreted as true;
s3, constructing a second set Y, and limiting the true and false of atoms in the fixed atomic set in interpretation through the second set Y;
s4, iterating the first target formula set until the intersection of the original subset M and the minimum original subset P is an empty set to obtain a solving model M of the constraint theoretical model, wherein the first target formula set specifically comprises:
optionally, before the step S4, the method further includes:
if the original subset M is not satisfied, the called Model (A) returns to the unsat, otherwise, a Model of the clause set A is returned, and the Model is assumed to be correct.
Optionally, the constructing the second set Y, limiting the true and false of the atoms in the fixed atom set in the interpretation by the second set Y is specifically:
build a second set Y, and
optionally, the step S2 further includes:
s5, constructing a third set Y, and limiting that if atoms in the fixed atomic set appear in the original subset M through the third set Y, the atoms are replaced with true in the clause set A, otherwise, the atoms are replaced with false;
s6, constructing A' ≡A, and defining that atoms in P and not in the atom set M are replaced by false in the clause set A;
s7, iterating a second target formula set until the intersection of the original subset M and the minimum original subset P is an empty set, and obtaining the intersection of a solution model M of a constraint theoretical model and a third set Y, wherein the second target formula set is specifically:
optionally, the step S5 specifically includes:
a third set Y is constructed, and Y+.M- (P+.Z).
A second aspect of the present application provides a solution apparatus for limiting a theoretical model, the apparatus comprising:
an initializing unit, configured to initialize parameters A, P, Z, where a is a clause set, P is an extremely small original subset, Z is a variable atom set, P and Z are disjoint original subsets, P and Z are fixed original subsets, and a constraint that the extremely small original subset P has the variable original subset Z on the clause set a is denoted as CIRC [ a; p is as follows; z, the atom set M is CIRC [ A ]; p is as follows; z ] and is a model for calculating clause set A.
A first construction unit for constructing a first set T by which atoms in the minimal primitive subset P that are less restricted are interpreted as true;
a second construction unit configured to construct a second set Y by which the true or false of atoms in the fixed atom set in interpretation is restricted;
the first solving unit is configured to obtain a solving model M of the constraint theoretical model by iterating the first target formula set until an intersection of the original subset M and the minimum original subset P is an empty set, where the first target formula set specifically is:
optionally, the method further comprises:
the supposition unit is used for returning the called Model (A) to the unsatisfied state if the original subset M is unsatisfiable, otherwise returning a Model of the clause set A, and supposing that the Model is correct.
Optionally, the method further comprises:
a third construction unit, configured to construct a third set Y, and restrict, by the third set Y, that if an atom in the fixed atom set appears in the original subset M, the atom is replaced with true in the clause set a, otherwise, the atom is replaced with false;
a fourth construction unit for constructing a' ≡a and defining that atoms in P and not in the atom set M are replaced with false in the clause set a;
the second solving unit is configured to iterate the second target formula set until the intersection of the original subset M and the minimal original subset P is an empty set, so as to obtain an intersection of the solution model M of the constraint theoretical model and the third set Y, where the second target formula set specifically is:
a third aspect of the present application provides a solution apparatus for limiting a theoretical model, the apparatus comprising a processor and a memory:
the memory is used for storing program codes and transmitting the program codes to the processor;
the processor is configured to execute the steps of the method of limiting the solution of the theoretical model according to the first aspect described above according to instructions in the program code.
A fourth aspect of the present application provides a computer readable storage medium for storing program code for performing the method of the first aspect described above.
From the above technical solutions, the embodiments of the present application have the following advantages:
in the application, a solution method, a device, equipment and a storage medium for a constraint theoretical model are provided, the constraint theoretical model is solved based on a satisfiable model, under the condition that the interpretation of atoms in a fixed atomic set is kept unchanged, less true atom interpretations in a tiny primitive subset P are searched, a principle clause set A is required to be satisfied, the solution model is gradually approximated to the constraint theoretical model in an iterative mode according to the definition of the constraint theoretical model, and the technical problem that the number worst case of a ring formula in the prior art possibly reaches an index level and the existence of a term needs to be eliminated in calculation is solved.
Drawings
FIG. 1 is a first method flow diagram of a solution method for limiting a theoretical model in an embodiment of the present application;
FIG. 2 is a second method flow diagram of a solution method for limiting a theoretical model in an embodiment of the present application;
FIG. 3 is a schematic structural diagram of a solving apparatus for limiting a theoretical model in an embodiment of the present application;
fig. 4 is a schematic structural diagram of a solution device for limiting a theoretical model in an embodiment of the present application.
Detailed Description
In order to make the present application solution better understood by those skilled in the art, the following description will clearly and completely describe the technical solution in the embodiments of the present application with reference to the accompanying drawings in the embodiments of the present application, and it is apparent that the described embodiments are only some embodiments of the present application, not all embodiments. All other embodiments, which can be made by one of ordinary skill in the art without undue burden from the present disclosure, are within the scope of the present disclosure.
The application designs a solving method, a device, equipment and a storage medium for limiting a theoretical model, which solve the technical problems that the number of ring formulas in the prior art can reach an exponential level in the worst case and the existence of a graduated word is required to be eliminated in calculation.
For ease of understanding, referring to fig. 1, fig. 1 is a flowchart of a first method of a solution method for limiting a theoretical model in an embodiment of the present application, as shown in fig. 1, specifically:
s1, initializing a parameter A, P, Z, wherein A is a clause set, P is a very small primitive subset, Z is a variable atom set, P and Z are disjoint primitive subsets, one of P and Z is not a fixed primitive subset, and the limitation that the very small primitive subset P has the variable primitive subset Z on the clause set A is recorded as CIRC [ A; p is as follows; z, the atom set M is CIRC [ A ]; p is as follows; z ] and is a model for calculating clause set A.
S2, constructing a first set T, wherein atoms in the tiny primitive subset P which are limited by the first set T are interpreted as true;
s3, constructing a second set Y, and limiting the true and false of atoms in the fixed atomic set in interpretation through the second set Y;
s4, iterating the first target formula set until the intersection of the original subset M and the minimum original subset P is an empty set to obtain a solving model M of the constraint theoretical model, wherein the first target formula set specifically comprises:
further, before the step S4, the method further includes:
if the original subset M is not satisfied, the called Model (A) returns to the unsat, otherwise, a Model of the clause set A is returned, and the Model is assumed to be correct.
Further, the construction of the second set Y, and limiting the true and false of the atoms in the fixed atomic set in the explanation through the second set Y is specifically as follows:
build a second set Y, and
referring to fig. 2, fig. 2 is a flowchart of a second method of the solution method of limiting the theoretical model in the embodiment of the present application, as shown in fig. 2, specifically:
s1, initializing a parameter A, P, Z, wherein A is a clause set, P is a very small primitive subset, Z is a variable atom set, P and Z are disjoint primitive subsets, one of P and Z is not a fixed primitive subset, and the limitation that the very small primitive subset P has the variable primitive subset Z on the clause set A is recorded as CIRC [ A; p is as follows; z, the atom set M is CIRC [ A ]; p is as follows; z ] and is a model for calculating clause set A.
S2, constructing a first set T, wherein atoms in the tiny primitive subset P which are limited by the first set T are interpreted as true;
s5, constructing a third set Y, and limiting that if atoms in the fixed atomic set appear in the original subset M through the third set Y, the atoms are replaced with true in the clause set A, otherwise, the atoms are replaced with false;
s6, constructing A' ≡A, and defining that atoms in P and not in the atom set M are replaced by false in the clause set A;
s7, iterating a second target formula set until the intersection of the original subset M and the minimum original subset P is an empty set, and obtaining the intersection of a solution model M of a constraint theoretical model and a third set Y, wherein the second target formula set is specifically:
further, the step S5 specifically includes:
a third set Y is constructed, and Y+.M- (P+.Z).
Referring to fig. 3, fig. 3 is a schematic structural diagram of a solving apparatus for limiting a theoretical model in an embodiment of the present application, as shown in fig. 3, specifically:
an initializing unit 301, configured to initialize a parameter A, P, Z, where a is a clause set, P is an extremely small primitive subset, Z is a variable primitive set, P and Z are disjoint primitive subsets, P and Z are fixed primitive subsets, and a constraint that the extremely small primitive subset P has the variable primitive subset Z on the clause set a is denoted as CIRC [ a; p is as follows; z, the atom set M is CIRC [ A ]; p is as follows; z ] and is a model for calculating clause set A.
A first construction unit 302 for constructing a first set T by which atoms in the minimal primitive subset P that are less restricted are interpreted as true;
a second construction unit 303 for constructing a second set Y by which the true or false of atoms in the fixed atom set in interpretation is restricted;
the first solving unit 304 is configured to obtain a solution model M of the constraint theoretical model by iterating a first target formula set until an intersection of the original subset M and the minimum original subset P is an empty set, where the first target formula set is specifically:
further, the method further comprises the following steps:
the supposition unit is used for returning the called Model (A) to the unsatisfied state if the original subset M is unsatisfiable, otherwise returning a Model of the clause set A, and supposing that the Model is correct.
Further, the method further comprises the following steps:
a third construction unit 305, configured to construct a third set Y, by which the atoms in the fixed atom set are restricted to be replaced with true in the clause set a if they appear in the original subset M, and to be replaced with false otherwise;
a fourth construction unit 306 for constructing a' ≡a, and defining that atoms in P and not in the atom set M are replaced with false in the clause set a;
a second solving unit 307, configured to obtain an intersection of the solution model M of the constraint theoretical model and the third set Y by iterating the second target formula set until the intersection of the original subset M and the minimal original subset P is an empty set, where the second target formula set is specifically:
the embodiment of the present application further provides another solving device for limiting the theoretical model, as shown in fig. 4, for convenience of explanation, only the portion relevant to the embodiment of the present application is shown, and specific technical details are not disclosed, please refer to the method portion of the embodiment of the present application. The terminal can be any terminal equipment including a mobile phone, a tablet personal computer, a personal digital assistant (English full name: personal Digital Assistant, english abbreviation: PDA), a Sales terminal (English full name: point of Sales, english abbreviation: POS), a vehicle-mounted computer and the like, taking the mobile phone as an example of the terminal:
fig. 4 is a block diagram showing a part of a structure of a mobile phone related to a terminal provided in an embodiment of the present application. Referring to fig. 4, the mobile phone includes: radio Frequency (RF) circuit 1010, memory 1020, input unit 1030, display unit 1040, sensor 1050, audio circuit 1060, wireless fidelity (wireless fidelity, wiFi) module 1070, processor 1080, and power source 1090. Those skilled in the art will appreciate that the handset configuration shown in fig. 4 is not limiting of the handset and may include more or fewer components than shown, or may combine certain components, or may be arranged in a different arrangement of components.
The following describes the components of the mobile phone in detail with reference to fig. 4:
the RF circuit 1010 may be used for receiving and transmitting signals during a message or a call, and particularly, after receiving downlink information of a base station, the signal is processed by the processor 1080; in addition, the data of the design uplink is sent to the base station. Generally, RF circuitry 1010 includes, but is not limited to, an antenna, at least one amplifier, a transceiver, a coupler, a low noise amplifier (English full name: low Noise Amplifier, english abbreviation: LNA), a duplexer, and the like. In addition, the RF circuitry 1010 may also communicate with networks and other devices via wireless communications. The wireless communication may use any communication standard or protocol, including but not limited to global system for mobile communications (english: global System ofMobile communication, english: GSM), general packet radio service (english: general Packet Radio Service, GPRS), code division multiple access (english: code Division Multiple Access, english: CDMA), wideband code division multiple access (english: wideband Code Division Multiple Access, english: WCDMA), long term evolution (english: long Term Evolution, english: LTE), email, short message service (english: short Messaging Service, SMS), and the like.
The memory 1020 may be used to store software programs and modules that the processor 1080 performs various functional applications and data processing of the handset by executing the software programs and modules stored in the memory 1020. The memory 1020 may mainly include a storage program area and a storage data area, wherein the storage program area may store an operating system, an application program (such as a sound playing function, an image playing function, etc.) required for at least one function, and the like; the storage data area may store data (such as audio data, phonebook, etc.) created according to the use of the handset, etc. In addition, memory 1020 may include high-speed random access memory and may also include non-volatile memory, such as at least one magnetic disk storage device, flash memory device, or other volatile solid state memory device.
The input unit 1030 may be used to receive input numeric or character information and generate key signal inputs related to user settings and function control of the handset. In particular, the input unit 1030 may include a touch panel 1031 and other input devices 1032. The touch panel 1031, also referred to as a touch screen, may collect touch operations thereon or thereabout by a user (e.g., operations of the user on the touch panel 1031 or thereabout using any suitable object or accessory such as a finger, stylus, etc.), and drive the corresponding connection device according to a predetermined program. Alternatively, the touch panel 1031 may include two parts, a touch detection device and a touch controller. The touch detection device detects the touch azimuth of a user, detects a signal brought by touch operation and transmits the signal to the touch controller; the touch controller receives touch information from the touch detection device and converts it into touch point coordinates, which are then sent to the processor 1080 and can receive commands from the processor 1080 and execute them. Further, the touch panel 1031 may be implemented in various types such as resistive, capacitive, infrared, and surface acoustic wave. The input unit 1030 may include other input devices 1032 in addition to the touch panel 1031. In particular, other input devices 1032 may include, but are not limited to, one or more of a physical keyboard, function keys (e.g., volume control keys, switch keys, etc.), a track ball, a mouse, a joystick, etc.
The display unit 1040 may be used to display information input by a user or information provided to the user and various menus of the mobile phone. The display unit 1040 may include a display panel 1041, and alternatively, the display panel 1041 may be configured in the form of a liquid crystal display (english full name: liquid Crystal Display, acronym: LCD), an Organic Light-Emitting Diode (OLED), or the like. Further, the touch panel 1031 may overlay the display panel 1041, and when the touch panel 1031 detects a touch operation thereon or thereabout, the touch panel is transferred to the processor 1080 to determine a type of touch event, and then the processor 1080 provides a corresponding visual output on the display panel 1041 according to the type of touch event. Although in fig. 4, the touch panel 1031 and the display panel 1041 are two independent components for implementing the input and output functions of the mobile phone, in some embodiments, the touch panel 1031 and the display panel 1041 may be integrated to implement the input and output functions of the mobile phone.
The handset may also include at least one sensor 1050, such as a light sensor, a motion sensor, and other sensors. Specifically, the light sensor may include an ambient light sensor and a proximity sensor, wherein the ambient light sensor may adjust the brightness of the display panel 1041 according to the brightness of ambient light, and the proximity sensor may turn off the display panel 1041 and/or the backlight when the mobile phone moves to the ear. As one of the motion sensors, the accelerometer sensor can detect the acceleration in all directions (generally three axes), and can detect the gravity and direction when stationary, and can be used for applications of recognizing the gesture of a mobile phone (such as horizontal and vertical screen switching, related games, magnetometer gesture calibration), vibration recognition related functions (such as pedometer and knocking), and the like; other sensors such as gyroscopes, barometers, hygrometers, thermometers, infrared sensors, etc. that may also be configured with the handset are not described in detail herein.
WiFi belongs to a short-distance wireless transmission technology, and a mobile phone can help a user to send and receive emails, browse webpages, access streaming media and the like through a WiFi module 1070, so that wireless broadband Internet access is provided for the user. Although fig. 4 shows a WiFi module 1070, it is understood that it does not belong to the necessary constitution of the handset, and can be omitted entirely as required within the scope of not changing the essence of the invention.
The handset further includes a power source 1090 (e.g., a battery) for powering the various components, which may preferably be logically connected to the processor 1080 by a power management system, such as to provide for managing charging, discharging, and power consumption by the power management system.
Although not shown, the mobile phone may further include a camera, a bluetooth module, etc., which will not be described herein.
In the embodiment of the present application, the processor 1080 included in the terminal further has the following functions:
s1, initializing a parameter A, P, Z, wherein A is a clause set, P is a very small primitive subset, Z is a variable atom set, P and Z are disjoint primitive subsets, one of P and Z is not a fixed primitive subset, and the limitation that the very small primitive subset P has the variable primitive subset Z on the clause set A is recorded as CIRC [ A; p is as follows; z, the atom set M is CIRC [ A ]; p is as follows; z ] and is a model for calculating clause set A.
S2, constructing a first set T, wherein atoms in the tiny primitive subset P which are limited by the first set T are interpreted as true;
s3, constructing a second set Y, and limiting the true and false of atoms in the fixed atomic set in interpretation through the second set Y;
s4, iterating the first target formula set until the intersection of the original subset M and the minimum original subset P is an empty set to obtain a solving model M of the constraint theoretical model, wherein the first target formula set specifically comprises:
the embodiments of the present application also provide a computer readable storage medium for storing program code for executing any one of the implementation methods of the solution method for limiting a theoretical model described in the foregoing embodiments.
In the embodiment of the application, a solution method, a device, equipment and a storage medium for a constraint theoretical model are provided, the constraint theoretical model is solved based on a satisfiable model, under the condition that the interpretation of atoms in a fixed atomic set is kept unchanged, less true atom interpretations in a tiny primitive subset P are searched, a theory clause set A is required to be satisfied, the solution model is gradually approximated to the constraint theoretical model in an iterative mode according to the definition of the constraint theoretical model, and the technical problem that the number worst case of a ring formula in the prior art possibly reaches an index level and the existence of a word is required to be eliminated in calculation is solved.
It will be clear to those skilled in the art that, for convenience and brevity of description, specific working procedures of the above-described systems, apparatuses and units may refer to corresponding procedures in the foregoing method embodiments, which are not repeated herein.
The terms "first," "second," "third," "fourth," and the like in the description of the present application and in the above-described figures, if any, are used for distinguishing between similar objects and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used may be interchanged where appropriate such that embodiments of the present application described herein may be capable of operation in sequences other than those illustrated or described herein, for example. Furthermore, the terms "comprises," "comprising," and "having," and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.
It should be understood that in this application, "at least one" means one or more, and "a plurality" means two or more. "and/or" for describing the association relationship of the association object, the representation may have three relationships, for example, "a and/or B" may represent: only a, only B and both a and B are present, wherein a, B may be singular or plural. The character "/" generally indicates that the context-dependent object is an "or" relationship. "at least one of" or the like means any combination of these items, including any combination of single item(s) or plural items(s). For example, at least one (one) of a, b or c may represent: a, b, c, "a and b", "a and c", "b and c", or "a and b and c", wherein a, b, c may be single or plural.
In the several embodiments provided in this application, it should be understood that the disclosed systems, apparatuses, and methods may be implemented in other ways. For example, the apparatus embodiments described above are merely illustrative, e.g., the division of the units is merely a logical function division, and there may be additional divisions when actually implemented, e.g., multiple units or components may be combined or integrated into another system, or some features may be omitted or not performed. Alternatively, the coupling or direct coupling or communication connection shown or discussed with each other may be an indirect coupling or communication connection via some interfaces, devices or units, which may be in electrical, mechanical or other form.
The units described as separate units may or may not be physically separate, and units shown as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.
In addition, each functional unit in each embodiment of the present application may be integrated in one processing unit, or each unit may exist alone physically, or two or more units may be integrated in one unit. The integrated units may be implemented in hardware or in software functional units.
The integrated units, if implemented in the form of software functional units and sold or used as stand-alone products, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present application may be embodied in essence or a part contributing to the prior art or all or part of the technical solution in the form of a software product stored in a storage medium, including several instructions to cause a computer device (which may be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the methods described in the embodiments of the present application. And the aforementioned storage medium includes: u disk, mobile hard disk, read-Only Memory (ROM), random access Memory (Random Access Memory, RAM), magnetic disk or optical disk, etc.
The above embodiments are merely for illustrating the technical solution of the present application, and not for limiting the same; although the present application has been described in detail with reference to the foregoing embodiments, it should be understood by those of ordinary skill in the art that: the technical scheme described in the foregoing embodiments can be modified or some technical features thereof can be replaced by equivalents; such modifications and substitutions do not depart from the spirit and scope of the corresponding technical solutions.
Claims (10)
1. A method of solving a constraint theoretical model, comprising:
s1, initializing a parameter A, P, Z, wherein A is a clause set, P is a very small primitive subset, Z is a variable atom set, P and Z are disjoint primitive subsets, one of P and Z is not a fixed primitive subset, and the limitation that the very small primitive subset P has the variable primitive subset Z on the clause set A is recorded as CIRC [ A; p is as follows; z, the atom set M is CIRC [ A ]; p is as follows; z ] and is a model for calculating clause set A.
S2, constructing a first set T, wherein atoms in the tiny primitive subset P which are limited by the first set T are interpreted as true;
s3, constructing a second set Y, and limiting the true and false of atoms in the fixed atomic set in interpretation through the second set Y;
s4, iterating the first target formula set until the intersection of the original subset M and the minimum original subset P is an empty set to obtain a solving model M of the constraint theoretical model, wherein the first target formula set specifically comprises:
2. the method for solving a constraint theoretical model according to claim 1, characterized in that said step S4 further comprises, before:
if the original subset M is not satisfied, the called Model (A) returns to the unsat, otherwise, a Model of the clause set A is returned, and the Model is assumed to be correct.
3. The method for solving the constraint theoretical model according to claim 1, wherein the constructing the second set Y, limiting the true and false of the atoms in the fixed atomic set in the interpretation by the second set Y is:
build a second set Y, and
4. the method of claim 1, wherein the step S2 further comprises:
s5, constructing a third set Y, and limiting that if atoms in the fixed atomic set appear in the original subset M through the third set Y, the atoms are replaced with true in the clause set A, otherwise, the atoms are replaced with false;
s6, constructing A' ≡A, and defining that atoms in P and not in the atom set M are replaced by false in the clause set A;
s7, iterating a second target formula set until the intersection of the original subset M and the minimum original subset P is an empty set, and obtaining the intersection of a solution model M of a constraint theoretical model and a third set Y, wherein the second target formula set is specifically:
5. the method for solving a constraint theoretical model according to claim 4, wherein the step S5 specifically comprises:
a third set Y is constructed, and Y+.M- (P+.Z).
6. A solving apparatus for limiting a theoretical model, comprising:
an initializing unit, configured to initialize parameters A, P, Z, where a is a clause set, P is an extremely small original subset, Z is a variable atom set, P and Z are disjoint original subsets, P and Z are fixed original subsets, and a constraint that the extremely small original subset P has the variable original subset Z on the clause set a is denoted as CIRC [ a; p is as follows; z, the atom set M is CIRC [ A ]; p is as follows; z ] and is a model for calculating clause set A.
A first construction unit for constructing a first set T by which atoms in the minimal primitive subset P that are less restricted are interpreted as true;
a second construction unit configured to construct a second set Y by which the true or false of atoms in the fixed atom set in interpretation is restricted;
the first solving unit is configured to obtain a solving model M of the constraint theoretical model by iterating the first target formula set until an intersection of the original subset M and the minimum original subset P is an empty set, where the first target formula set specifically is:
7. the constraint solving apparatus of theoretical model of claim 6, further comprising:
the supposition unit is used for returning the called Model (A) to the unsatisfied state if the original subset M is unsatisfiable, otherwise returning a Model of the clause set A, and supposing that the Model is correct.
8. The constraint solving apparatus of theoretical model of claim 6, further comprising:
a third construction unit, configured to construct a third set Y, and restrict, by the third set Y, that if an atom in the fixed atom set appears in the original subset M, the atom is replaced with true in the clause set a, otherwise, the atom is replaced with false;
a fourth construction unit for constructing a' ≡a and defining that atoms in P and not in the atom set M are replaced with false in the clause set a;
the second solving unit is configured to iterate the second target formula set until the intersection of the original subset M and the minimal original subset P is an empty set, so as to obtain an intersection of the solution model M of the constraint theoretical model and the third set Y, where the second target formula set specifically is:
9. a solution device for limiting a theoretical model, said device comprising a processor and a memory:
the memory is used for storing program codes and transmitting the program codes to the processor;
the processor is configured to execute the solution method of the constraint theoretical model of any one of claims 1-5 according to instructions in the program code.
10. A computer readable storage medium for storing a program code for performing the solution method of the constraint theoretical model of any one of claims 1-5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310113809.4A CN116340695A (en) | 2023-02-15 | 2023-02-15 | Solving method, device, equipment and storage medium for limiting theoretical model |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310113809.4A CN116340695A (en) | 2023-02-15 | 2023-02-15 | Solving method, device, equipment and storage medium for limiting theoretical model |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN116340695A true CN116340695A (en) | 2023-06-27 |
Family
ID=86893826
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310113809.4A Pending CN116340695A (en) | 2023-02-15 | 2023-02-15 | Solving method, device, equipment and storage medium for limiting theoretical model |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116340695A (en) |
-
2023
- 2023-02-15 CN CN202310113809.4A patent/CN116340695A/en active Pending
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108305296B (en) | Image description generation method, model training method, device and storage medium | |
| CN111125523B (en) | Searching method, searching device, terminal equipment and storage medium | |
| CN110597793A (en) | Data management method and device, electronic equipment and computer readable storage medium | |
| CN110049187B (en) | Display method and terminal equipment | |
| CN110879680A (en) | Icon management method and electronic equipment | |
| CN106534288A (en) | Data transmission method and mobile terminal | |
| CN111966491A (en) | Method for counting occupied memory and terminal equipment | |
| CN116468382A (en) | RPA robot flow management method, device, equipment and storage medium | |
| CN110708673A (en) | Position determination method and portable multifunctional equipment | |
| CN115904179A (en) | Multi-screen desktop split-screen display method, device, equipment and storage medium | |
| CN116340695A (en) | Solving method, device, equipment and storage medium for limiting theoretical model | |
| CN110109788B (en) | Multi-key detection method and device, electronic equipment and storage medium | |
| CN110809234A (en) | Figure category identification method and terminal equipment | |
| CN106657278B (en) | Data transmission method and device and computer equipment | |
| CN116069269A (en) | Custom receipt printing method, device, equipment and storage medium | |
| CN117539460A (en) | Data set editing processing method and system | |
| CN116303086A (en) | End-to-end testing method, configuration method, device, equipment and storage medium | |
| CN117807132A (en) | Distributed database histogram creation method, device, equipment and storage medium | |
| CN116680292A (en) | Data query method, device, equipment and computer readable storage medium | |
| CN116382945A (en) | Card making processing method, system, equipment and computer readable storage medium | |
| CN117743355A (en) | Concurrent updating method, device and equipment for distributed database and storage medium | |
| CN116777219A (en) | Target enterprise risk assessment method, device, equipment and storage medium | |
| CN117688085A (en) | Distributed database switching method, device, system, equipment and storage medium | |
| CN118035765A (en) | Text similarity matching method and device, storage medium and electronic equipment | |
| CN116881143A (en) | Data object copying abnormality investigation method, device, equipment and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |