[go: up one dir, main page]

WO2021154279A1 - Système et procédé de résolution d'entrées conflictuelles - Google Patents

Système et procédé de résolution d'entrées conflictuelles Download PDF

Info

Publication number
WO2021154279A1
WO2021154279A1 PCT/US2020/016113 US2020016113W WO2021154279A1 WO 2021154279 A1 WO2021154279 A1 WO 2021154279A1 US 2020016113 W US2020016113 W US 2020016113W WO 2021154279 A1 WO2021154279 A1 WO 2021154279A1
Authority
WO
WIPO (PCT)
Prior art keywords
input
user
control
ciq
agreement
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.)
Ceased
Application number
PCT/US2020/016113
Other languages
English (en)
Inventor
Josh OLKOWSKI
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Lit Ideas LLC
Original Assignee
Lit Ideas LLC
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Lit Ideas LLC filed Critical Lit Ideas LLC
Priority to PCT/US2020/016113 priority Critical patent/WO2021154279A1/fr
Publication of WO2021154279A1 publication Critical patent/WO2021154279A1/fr
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/10—Services
    • G06Q50/18—Legal services
    • G06Q50/182—Alternative dispute resolution
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
    • G06Q40/12—Accounting
    • G06Q40/123—Tax preparation or submission

Definitions

  • the present disclosure relates to automated resolution of conflicting inputs to a computer system.
  • a system and method are disclosed to evaluate selected inputs.
  • the inputs may relate to one or more conditions, assertions, etc.
  • the method includes a process to determine a combination of or agreement between two inputs. The method may, therefore, provide an output based on the determination.
  • a system that is configured to execute the method.
  • FIG. 1 is high-level block diagram of an example implementation of a resolution system according to the principles of the present disclosure.
  • FIG. 2 is a functional block diagram of an example implementation of a resolution system according to the principles of the present disclosure.
  • FIGs. 3A-3E together are a flowchart of example operations performed by an implementation of the resolution system.
  • a first user device 110 and a second user device 115 communicate with a resolution system 120 via a communication system such as distributed communications system 130, which may include the Internet.
  • a first user associated with the first user device 110 and a second user associated with the second user device 115 may use the resolution system to resolve a dispute between the first user and the second user.
  • the first and second users may disagree on the verity of a statement and may use the resolution system 120 to resolve the disagreement.
  • the first and second user devices may be a single device used serially by at least two users. It is also understood, that first and second users may each be a group or plurality of users (e.g. a group of individuals or users that agree).
  • FIG. 2 is a functional block diagram of an example implementation of the resolution system 120.
  • the resolution system 120 includes a user portal 210 and a data store 220.
  • the first user and a second user may use the first user device 110 and the second user devices 115, respectively, to access the resolution system 120 via the user portal 210.
  • the user portal 210 may be implemented as a web portal.
  • the user portal 210 presents a user interface (UI) to the first user and the second user.
  • UI user interface
  • the user portal 210 may present different UIs to the first and second users. Reference herein to user may be to either the first or second user (or the other relative to a previously referenced user) unless otherwise indicated.
  • the user portal 210 may prompt the first or second user for information necessary to resolve the disagreement and store responses received from the users in a data store 220.
  • the user portal 210 may request a user to enter a name.
  • the user portal 210 may prompt a user to enter statements related to the disagreement.
  • a statement may take the form of a simple sentence that can be held true or false by a user.
  • a simple sentence is defined to be a sentence with a single independent clause.
  • a simple sentence may include no dependent clauses or may include one or more dependent clauses.
  • the user portal 210 may verify a user’s response prior to storing the response in the data store 220. For example, the user portal 210 may confirm that a provided name is a valid name or that an entered statement is a simple sentence. In some implementations, the user portal 210 may prompt a user to verify the input of another user. Accordingly, the first or second user devices 110, 115 may be used to receive input from the responsible user.
  • the resolution system may include an input verification module 230.
  • the user portal 210 In response to receiving an input from a user, the user portal 210 provides the response entered by the user and an expected form of the response — i.e., a valid name or a simple sentence — to the input verification module 230.
  • the user portal 210 provides the response and the input verification module 230 compares it to an internal or saved expected form in the input verification module 230.
  • the input verification module 230 determines whether the received response is valid based on the expected form of the response and provides an indication of the verification to the user portal.
  • the user portal 210 may prompt the user (e.g. the first user) to enter a new response.
  • the user portal 210 may store the response in the data store 220.
  • the data store 220 may be a relational database, hierarchical database, or another organized collection of data.
  • the user portal 210 may also store an indication of the user — for example, the name of the user — that provided the response.
  • the user portal may also store an indication of which users hold a stored response to be true.
  • the user portal 210 may organize certain stored responses, such as statements, using a tree or other hierarchical organization structure. A new response may be designated as a child of a previously stored response.
  • the data store 220 may include a list or another type of ordered array for each stored response that indicates the children of the response. Stored responses that have the same parent — i.e., are children of the same stored response — may be referred to as siblings.
  • the user portal 210 may use the responses and associated data stored in the data store 220 to generate prompts for the first and/or second users. For example, the user portal 210 may prompt a user to provide support for a previously entered statement. The user portal 210 may update the information stored in the data store 220 based on received responses. The resolution system 120 uses the information stored in the data store 220 to determine when the disagreement between the first user and the second user has been resolved.
  • FIGs. 3A-3E are a flowchart that describes example operations of the resolution system 120.
  • Control begins at 3005 where control prompts a first user to provide a name and then stores the first user’s response.
  • control determines whether the response provided by the first user is a valid name. If so, control continues with 3015; otherwise, control returns to 3005.
  • control prompts a second user to verify that the first user’s response is a valid name.
  • control may use natural language processing and/or other known text recognition techniques to determine whether the first user’s response is a valid name.
  • Control continues with 3015.
  • control prompts the second user to provide a name. Control then stores the second user’s response.
  • control determines whether the response from the second user is a valid name. If so, control continues with 3025; otherwise, control returns to 3015.
  • control assigns roles to the first user and the second user. For example, control may set the first user to the support providing party (SPP) and the second user to the other party (OP). Control continues with 3030, where control prompts OP to enter the main conflict (MC) statement. Control stores the provided response as a last response (LR). Control continues with 3035.
  • SPP support providing party
  • OP OP
  • MC main conflict
  • LR last response
  • control determines whether LR is a simple sentence. For example, control determines whether LR consists of only a single independent clause. If so, control continues with 3040; otherwise, control returns to 3030. In some implementations, control may prompt SPP to verify that LR is a simple sentence. In other implementations, control may use natural language processing and/or other known parsing techniques to determine whether LR is a simple sentence. At 3040, control determines whether SPP and OP disagree on LR. For example, control may prompt SPP to enter if LR is true and prompt OP to enter if LR is false.
  • control determines that SPP and OP disagree on LR, control continues with 3045; otherwise, control returns to 3030. If control determines that SPP and OP agree on LR then control may complete to block 3275, as discussed herein.
  • control initializes a set of variables. For example, control creates a main claims parent (MCP) for the conflict between the first user and the second user. Control sets a main claim (MC) equal to a combination of LR and an indication that SPP holds LR to be true. Control stores MC as a child of MCP by adding MC to a list of children of MCP. Control sets a claim in question (cIQ) to MC — for example, control may set cIQ to point to MC. Control then continues with 3050.
  • MCP main claims parent
  • MC main claim
  • cIQ claim in question
  • control prompts SPP to enter a supporting statement related to cIQ.
  • Control stores the provided response and an indication that SPP holds the statement to be true as a support in question (sIQ).
  • control prompts SPP to enter a simple implication associated with sIQ and cIQ.
  • Control stores the provided response and an indication that SPP holds the implication to be true as a warrant in question (wIQ).
  • Control then continues with 3060, where control determines whether sIQ and wIQ are simple sentences. If so, control continues with 3065; otherwise, control returns to 3050.
  • control sets sIQ as a child of cIQ and then sets wIQ as a child of cIQ.
  • control may first add sIQ to the end of a list of children of cIQ and then add wIQ to the end of the list.
  • Control continues with 3070.
  • control prompts SPP if there is additional information to be entered regarding cIQ.
  • control returns to 3050 if there is information to be entered; otherwise, control continues with 3080.
  • control determines whether cIQ has an unsolved child authored by SPP. For example, control may determine whether any members of the list of children of cIQ are held true by SPP but not held true by OP. If so, control continues with 3085 of FIG. 3B; otherwise, control transfers to 3090 of FIG. 3D, as described below.
  • control sets sIQ to the first child of cIQ authored only by SPP and wIQ to NULL. Control progresses to 3095, where control prompts OP to enter if they agree with sIQ — for example, whether OP holds sIQ to be true. At 3100, control determines whether OP agrees with sIQ. If so, control continues with 3105; otherwise, control transfers to 3110. At 3105, control marks sIQ as resolved. For example, control may update sIQ to indicate that both SPP and OP hold sIQ to be true. Control then continues with 3110.
  • control determines whether cIQ has any unresolved children in its child list, after sIQ, that are only authored by SPP. If so, control continues with 3115; otherwise, control transfers to 3120 of FIG. 3C. At 3115, control sets sIQ to the first unresolved child of cIQ from 3110, and then control returns to 3095.
  • control determines how many children of cIQ are disagreements — i.e., how many children are unresolved. If control determines that cIQ has zero unresolved children, control transfers to 3125 of FIG. 3E, as described below. If control determines that cIQ has a single unresolved child, control progresses to 3130, where control sets cIQ to the unresolved child of cIQ and both sIQ and wIQ to NULL. Control then returns to 3070 of FIG. 3 A. If control determines that cIQ has two or more unresolved children, control continues with 3135.
  • control sets sIQ to the first child of cIQ that is a disagreement. For example, control sets sIQ to point to the first entry in the list of children of cIQ that is unresolved. Control then progresses to 3140, where control prompts SPP if sIQ should be resolved first. At 3145, if SPP chooses to attempt to resolve sIQ, control continues with 3150; otherwise, control continues with 3155. At 3150, control sets cIQ to sIQ and then sets sIQ, and wIQ to NULL. Control then returns to 3070 of FIG. 3A.
  • control determines whether cIQ has any children after sIQ in the list that are disagreements. For example, control determines whether the list of children of cIQ includes an unresolved entry that is after sIQ in the list. If so, control continues with 3160; otherwise, control returns to 3135. At 3160, control sets sIQ to be the first child of cIQ that is unresolved and after sIQ in the list. Control then returns to 3140.
  • control swaps the roles of the first user and the second user. For example, control sets the current SPP as the new OP and what was the current OP becomes the new SPP. Control then continues with 3170, where control prompts SPP to provide a negation of cIQ. Control stores SPP’s response as LR. At 3175, control determines whether LR is a simple sentence. If so, control continues with 3180; otherwise control returns to 3170.
  • control creates a sibling for cIQ (cIQ and the new child share a parent). For example, control inserts a new entry (that is a combination of LR and an indication that SPP holds LR to be true) in cIQ’s parent’s child list, with the new child immediately following cIQ in the list. Control then sets cIQ to the newly added child. Control continues with 3185, where control prompts OP to enter their position regarding cIQ — for example, if OP holds cIQ to be true. At 3190, control determines whether OP agrees with cIQ. If so, control transfers to 3195 of FIG. 3E; otherwise, control continues with 3200.
  • control prompts SPP for additional information that supports cIQ.
  • control determines whether SPP has additional supporting information related to cIQ. If so, control transfers to 3050 of FIG. 3A; otherwise, control continues with 3210.
  • control determines whether the first and second users are able to perform a demonstration or experiment to verify the truth of cIQ. If so, control continues with 3215; otherwise, control transfers to 3220.
  • control prompts the first and second user to perform the demonstration and/or experiment associated with cIQ.
  • control prompts a user to provide a new version of cIQ based on the results of the demonstration/experiment that both the first user and the second user hold to be true — i.e., agree on — and then stores the response as LR.
  • control prompts the first user to provide the new version of cIQ.
  • control prompts the user that is the current SPP to provide the new version of cIQ.
  • control determines whether LR is a simple sentence. If so, control continues with 3193 of FIG. 3E; otherwise, control returns to 3225.
  • control prompts a user to enter a new version of cIQ that both the first user and the second user hold to be true — i.e., agree on — and then stores the response as LR.
  • control prompts the first user to provide the new version of cIQ.
  • control prompts the user that is the current SPP to provide the new version of cIQ.
  • control determines whether LR is a simple sentence. If so, control continues with 3193 of FIG. 3E; otherwise, control returns to 3220.
  • control determines whether the first user and the second user both agree on a version of cIQ. If so, control continues with 3240; otherwise, control returns to 3070 of FIG. 3A.
  • control prompts a user to enter the agreed upon version of cIQ and stores the response as LR. In some implementations, control prompts the first user to provide the agreed upon version of cIQ. In other implementations, control prompts the user that is the current SPP to provide the agreed upon version of cIQ.
  • control determines whether LR is a simple sentence. If so, control continues with 3193; otherwise, control returns to 3240.
  • control adds LR as a resolved sibling of cIQ, inserted immediately after cIQ in cIQ’s parent’s child list.
  • Control continues with 3195, where control marks cIQ as resolved.
  • Control then progresses to 3250.
  • control determines whether cIQ has an adjacent older sibling (i.e. immediately prior sibling). For example, as discussed herein, adjacent is determined by control if control determines whether cIQ’s parent’s child list includes an entry immediately before cIQ in the list. If so, control continues with 3255; otherwise, control transfers to 3260.
  • control determines whether the adjacent older sibling of cIQ is unresolved — i.e., the first user and the second user do not both hold the adjacent older sibling to be true. If so, control continues with 3265; otherwise, control transfers to 3260. At 3265, control determines whether the same user input both cIQ and the adjacent older sibling of cIQ. For example, control may determine whether the same user authored both cIQ and the adjacent older sibling of cIQ. If so, control continues with 3260; otherwise, control transfers to 3270. At 3270, control marks the adjacent older sibling of cIQ as resolved. Control then progresses to 3260, where control determines whether cIQ is the main claim (MC). The cIQ is the MC if the cIQ is pointing to the MC from 3030. If so, control continues with 3275, where control displays an indication that the main (original) conflict between the first user and the second user has been resolved. Control then ends.
  • MC main claim
  • control sets cIQ to the parent of the current cIQ.
  • Control assigns the roles of SPP and OP based on the author of the new cIQ. For example, control sets the user that holds the new cIQ to be true as SPP and the other user as OP. Control then returns to 3120 of FIG. 3C.
  • the phrase at least one of A, B, and C should be construed to mean a logical (A OR B OR C), using a non-exclusive logical OR, and should not be construed to mean “at least one of A, at least one of B, and at least one of C.”
  • the term subset does not necessarily require a proper subset. In other words, a first subset of a first set may be coextensive with (equal to) the first set.
  • the direction of an arrow generally demonstrates the flow of information (such as data or instructions) that is of interest to the illustration.
  • information such as data or instructions
  • the arrow may point from element A to element B. This unidirectional arrow does not imply that no other information is transmitted from element B to element A.
  • element B may send requests for, or receipt acknowledgements of, the information to element A.
  • module or the term “controller” may be replaced with the term “circuit.”
  • the term “module” may refer to, be part of, or include: an Application Specific Integrated Circuit (ASIC); a digital, analog, or mixed analog/digital discrete circuit; a digital, analog, or mixed analog/digital integrated circuit; a combinational logic circuit; a field programmable gate array (FPGA); a processor circuit (shared, dedicated, or group) that executes code; a memory circuit (shared, dedicated, or group) that stores code executed by the processor circuit; other suitable hardware components that provide the described functionality; or a combination of some or all of the above, such as in a system-on-chip.
  • ASIC Application Specific Integrated Circuit
  • FPGA field programmable gate array
  • the module may include one or more interface circuits.
  • the interface circuit(s) may implement wired or wireless interfaces that connect to a local area network (LAN) or a wireless personal area network (WPAN).
  • LAN local area network
  • WPAN wireless personal area network
  • IEEE Institute of Electrical and Electronics Engineers
  • 802.11-2016 also known as the WIFI wireless networking standard
  • IEEE Standard 802.3-2015 also known as the ETHERNET wired networking standard
  • Examples of a WPAN are the BLUETOOTH wireless networking standard from the Bluetooth Special Interest Group and IEEE Standard 802.15.4.
  • the module may communicate with other modules using the interface circuit(s). Although the module may be depicted in the present disclosure as logically communicating directly with other modules, in various implementations the module may actually communicate via a communications system.
  • the communications system includes physical and/or virtual networking equipment such as hubs, switches, routers, and gateways.
  • the communications system connects to or traverses a wide area network (WAN) such as the Internet.
  • WAN wide area network
  • the communications system may include multiple LANs connected to each other over the Internet or point-to-point leased lines using technologies including Multiprotocol Label Switching (MPLS) and virtual private networks (VPNs).
  • MPLS Multiprotocol Label Switching
  • VPNs virtual private networks
  • the functionality of the module may be distributed among multiple modules that are connected via the communications system.
  • multiple modules may implement the same functionality distributed by a load balancing system.
  • the functionality of the module may be split between a server (also known as remote, or cloud) module and a client (or, user) module.
  • Some or all hardware features of a module may be defined using a language for hardware description, such as IEEE Standard 1364-2005 (commonly called “Verilog”) and IEEE Standard 1076-2008 (commonly called “VHDL”).
  • the hardware description language may be used to manufacture and/or program a hardware circuit.
  • some or all features of a module may be defined by a language, such as IEEE 1666-2005 (commonly called “SystemC”), that encompasses both code, as described below, and hardware description.
  • code may include software, firmware, and/or microcode, and may refer to programs, routines, functions, classes, data structures, and/or objects.
  • shared processor circuit encompasses a single processor circuit that executes some or all code from multiple modules.
  • group processor circuit encompasses a processor circuit that, in combination with additional processor circuits, executes some or all code from one or more modules. References to multiple processor circuits encompass multiple processor circuits on discrete dies, multiple processor circuits on a single die, multiple cores of a single processor circuit, multiple threads of a single processor circuit, or a combination of the above.
  • shared memory circuit encompasses a single memory circuit that stores some or all code from multiple modules.
  • group memory circuit encompasses a memory circuit that, in combination with additional memories, stores some or all code from one or more modules.
  • the term memory circuit is a subset of the term computer-readable medium.
  • the term computer-readable medium does not encompass transitory electrical or electromagnetic signals propagating through a medium (such as on a carrier wave); the term computer-readable medium may therefore be considered tangible and non-transitory.
  • Non limiting examples of a non-transitory computer-readable medium are nonvolatile memory circuits (such as a flash memory circuit, an erasable programmable read-only memory circuit, or a mask read-only memory circuit), volatile memory circuits (such as a static random access memory circuit or a dynamic random access memory circuit), magnetic storage media (such as an analog or digital magnetic tape or a hard disk drive), and optical storage media (such as a CD, a DVD, or a Blu-ray Disc).
  • nonvolatile memory circuits such as a flash memory circuit, an erasable programmable read-only memory circuit, or a mask read-only memory circuit
  • volatile memory circuits such as a static random access memory circuit or a dynamic random access memory circuit
  • magnetic storage media such as an analog or digital magnetic tape or a hard disk drive
  • optical storage media such as a CD, a DVD, or a Blu-ray Disc
  • the apparatuses and methods described in this application may be partially or fully implemented by a special purpose computer created by configuring a general purpose computer to execute one or more particular functions embodied in computer programs.
  • the functional blocks and flowchart elements described above serve as software specifications, which can be translated into the computer programs by the routine work of a skilled technician or programmer.
  • the computer programs include processor-executable instructions that are stored on at least one non-transitory computer-readable medium.
  • the computer programs may also include or rely on stored data.
  • the computer programs may encompass a basic input/output system (BIOS) that interacts with hardware of the special purpose computer, device drivers that interact with particular devices of the special purpose computer, one or more operating systems, user applications, background services, background applications, etc.
  • BIOS basic input/output system
  • the computer programs may include: (i) descriptive text to be parsed, such as HTML (hypertext markup language), XML (extensible markup language), or JSON (JavaScript Object Notation), (ii) assembly code, (iii) object code generated from source code by a compiler,
  • source code for execution by an interpreter
  • source code for compilation and execution by a just-in-time compiler
  • source code may be written using syntax from languages including C, C++, C#, Objective-C, Swift, Haskell, Go, SQL, R, Lisp, Java®, Fortran, Perl, Pascal, Curl, OCaml, JavaScript®, HTML5 (Hypertext Markup Language 5th revision), Ada, ASP (Active Server Pages), PHP (PHP: Hypertext Preprocessor), Scala, Eiffel, Smalltalk, Erlang, Ruby, Flash®, Visual Basic®, Lua, MATLAB, SIMULINK, and Python®.

Landscapes

  • Business, Economics & Management (AREA)
  • Engineering & Computer Science (AREA)
  • Finance (AREA)
  • Accounting & Taxation (AREA)
  • General Business, Economics & Management (AREA)
  • Physics & Mathematics (AREA)
  • Technology Law (AREA)
  • Development Economics (AREA)
  • Marketing (AREA)
  • Tourism & Hospitality (AREA)
  • Strategic Management (AREA)
  • Economics (AREA)
  • Theoretical Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Health & Medical Sciences (AREA)
  • Primary Health Care (AREA)
  • Human Resources & Organizations (AREA)
  • General Health & Medical Sciences (AREA)
  • User Interface Of Digital Computer (AREA)

Abstract

L'invention concerne un système et un procédé permettant d'évaluer des entrées sélectionnées. Les entrées peuvent se rapporter à une ou plusieurs conditions, assertions, etc.
PCT/US2020/016113 2020-01-31 2020-01-31 Système et procédé de résolution d'entrées conflictuelles Ceased WO2021154279A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PCT/US2020/016113 WO2021154279A1 (fr) 2020-01-31 2020-01-31 Système et procédé de résolution d'entrées conflictuelles

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/US2020/016113 WO2021154279A1 (fr) 2020-01-31 2020-01-31 Système et procédé de résolution d'entrées conflictuelles

Publications (1)

Publication Number Publication Date
WO2021154279A1 true WO2021154279A1 (fr) 2021-08-05

Family

ID=77078428

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/US2020/016113 Ceased WO2021154279A1 (fr) 2020-01-31 2020-01-31 Système et procédé de résolution d'entrées conflictuelles

Country Status (1)

Country Link
WO (1) WO2021154279A1 (fr)

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20010005829A1 (en) * 1999-12-10 2001-06-28 Raveis William M. System and method for managing customer relationships over a distributed computer network
US20030023539A1 (en) * 2001-07-27 2003-01-30 Wilce Scot D. Systems and methods for facilitating agreement definition via an agreement modeling system
US20040083119A1 (en) * 2002-09-04 2004-04-29 Schunder Lawrence V. System and method for implementing a vendor contract management system
US20070088663A1 (en) * 2000-07-05 2007-04-19 J. J. Donahue & Company Method and apparatus for negotiating a contract over a computer network
US20100004957A1 (en) * 2006-01-27 2010-01-07 Robert Ball Interactive system and methods for insurance-related activities

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20010005829A1 (en) * 1999-12-10 2001-06-28 Raveis William M. System and method for managing customer relationships over a distributed computer network
US20070088663A1 (en) * 2000-07-05 2007-04-19 J. J. Donahue & Company Method and apparatus for negotiating a contract over a computer network
US20030023539A1 (en) * 2001-07-27 2003-01-30 Wilce Scot D. Systems and methods for facilitating agreement definition via an agreement modeling system
US20040083119A1 (en) * 2002-09-04 2004-04-29 Schunder Lawrence V. System and method for implementing a vendor contract management system
US20100004957A1 (en) * 2006-01-27 2010-01-07 Robert Ball Interactive system and methods for insurance-related activities

Similar Documents

Publication Publication Date Title
US10942922B2 (en) Generation of data flow from syntax tree
US10713015B2 (en) Visual programming system
Geeraerts et al. Expand, enlarge and check: New algorithms for the coverability problem of WSTS
US8392467B1 (en) Directing searches on tree data structures
EP2587387A1 (fr) Calcul de similarité de terme utilisant un réseau sémantique de méta-modèle
EP1672547A1 (fr) Generation d'un modèle événementiel à partir d'une interface de langage naturel ordonné
CN108037913B (zh) xUML4MC模型到MSVL语言程序的转换方法、计算机可读存储介质
CN113901083B (zh) 基于多解析器的异构数据源操作资源解析定位方法和设备
WO2021086704A1 (fr) Génération de règles à l'aide d'éditions répétitives de code apprises
US10460044B2 (en) Methods and systems for translating natural language requirements to a semantic modeling language statement
Leduc et al. Synthesis method for hierarchical interface-based supervisory control
US7634722B2 (en) Reversible logic for widget and markup language generation
CN117369521A (zh) 用于无人机决策的行为树模型路径生成方法、装置及设备
US8849626B1 (en) Semantic translation of stateflow diagrams into input/output extended finite automata and automated test generation for simulink/stateflow diagrams
WO2020214343A1 (fr) Répétition automatique d'éditions de code spécifiques au contexte
WO2021154279A1 (fr) Système et procédé de résolution d'entrées conflictuelles
EP3005087A1 (fr) Éléments de configuration déclarative
Joosten et al. WickedXmas: Designing and verifying on-chip communication fabrics
US10209965B1 (en) In-line function synchronization
Ipate et al. Model learning and test generation using cover automata
US20220244971A1 (en) Framework for linearizing interviews while permitting user backtracking and provisionally storing answers for repopulating responses
US8595692B2 (en) Identifying lock granularization opportunities
CN114661302A (zh) 状态机模型的形式化自动翻译方法、装置及计算设备
US11550579B2 (en) Systems and methods for configurable ordered transformation of database content
CN119166157B (zh) 基于抽象语法树的命令构造函数生成方法、装置及设备

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 20917227

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 20917227

Country of ref document: EP

Kind code of ref document: A1

122 Ep: pct application non-entry in european phase

Ref document number: 20917227

Country of ref document: EP

Kind code of ref document: A1