To: | Modeling Benchmark Challenge <model-challenge@xxxxxxxxxxxxxxxx> |
---|---|
From: | Adrian Walker <adriandwalker@xxxxxxxxx> |
Date: | Sun, 6 May 2012 20:38:09 -0400 |
Message-id: | <CABbsESfN=ntxW5ncR2Vr3DYikG+tD=JFV8wxOK3N=j2Y5-As0A@xxxxxxxxxxxxxx> |
Henson,
Many thanks for your comments. Marry3 [1] is just a starter example to illustrate the approach. There are axioms similar to the ones you mention in other examples online. For example in [2] we have some-person is married to some-person1 that-person is married to some-person2 that-person1 and that-person2 are different --------------------------------------------------------------------- ALERT -- that-person is married to two different people and in [3] some-start1 is less than or equal some-fin2 some-start2 is less than or equal some-fin1 -------------------------------------------------------------------------------------- the period that-start1 to that-fin1 overlaps with the period that-start2 to that-fin2 So in principle, the answer to your axiom questions is Yes. Note though that there are no hidden axioms. In [1,2,3] all of the axioms used are explicitly listed. It's easy to edit them in a browser, and to add new ones too. To pick up on some earlier discussion, I guess the purpose here is EU-level federation of marriage rules and data from various EU states. Perhaps it would be best to work to a consensus for, say, England and Scotland as a first task? (We could also consider a pair of US states.) If there's interest in doing this in executable English, we can make an ID available. Could someone remind me please how to link to Cory's pictures? You wrote: Marriage was chosen as a challenge as it is probably the simplest example of a class of modeling problems which includes the detailed design description of a Boeing 747. While natural language is important one wonders if it scales to represent all of the components and connections in a large manufacture product. For scalability, the executable English system can use the axioms to automatically generate and run complex SQL queries [4]. However, it's likely that some hardware assist would be needed for such a large task. Does anyone know how deep the 747 parts hierarchy is? Hope this helps, -- Adrian Internet Business Logic A Wiki and SOA Endpoint for Executable Open Vocabulary English Q/A over SQL and RDF Online at www.reengineeringllc.com Shared use is free, and there are no advertisements Adrian Walker Reengineering [1] www.reengineeringllc.com/demo_agents/Marry3.agent [2] www.reengineeringllc.com/demo_agents/Marry2.agent [3] www.reengineeringllc.com/demo_agents/MedMine2.agent [4] www.reengineeringllc.com/Oil_Industry_Supply_Chain_by_Kowalski_and_Walker.pdf On Sat, May 5, 2012 at 4:41 PM, henson graves <henson.graves@xxxxxxxxxxx> wrote:
_________________________________________________________________________ Message Archives: http://ontolog.cim3.net/forum/model-challenge/ Subscribe: mailto:model-challenge-join@xxxxxxxxxxxxxxxx Config/Unsubscribe: http://ontolog.cim3.net/mailman/listinfo/model-challenge/ Shared Files: http://ontolog.cim3.net/file/work/ModelingBenchmarkChallenge/ References: http://ontolog.cim3.net/file/resource/project/ModelingBenchmarkChallenge/ Wiki: http://ontolog.cim3.net/cgi-bin/wiki.pl?ModelingBenchmarkChallenge (01) |
<Prev in Thread] | Current Thread | [Next in Thread> |
---|---|---|
|
Previous by Date: | [model-challenge] more on marriage representation, henson graves |
---|---|
Next by Date: | [model-challenge] marriage template, henson graves |
Previous by Thread: | Re: [model-challenge] example of reprsenting marriage in FOL, Obrst, Leo J. |
Next by Thread: | Re: [model-challenge] Executable English Reasoning, Adrian Walker |
Indexes: | [Date] [Thread] [Top] [All Lists] |