From: model-challenge-bounces@xxxxxxxxxxxxxxxx [mailto:model-challenge-bounces@xxxxxxxxxxxxxxxx] On Behalf Of Mike Bennett
Sent: Wednesday, May 09, 2012 10:42 AM
To: Modeling Benchmark Challenge
Subject: Re: [model-challenge] marriage template
I know a man in Uruguay who has two husbands.
On 09/05/2012 08:17, Matthew West wrote:
The main problem is that the diagram is underspecified.
How would I know whether every marriage must have a husband?
How would I know how many husbands might be involved in a marriage?
Could a marriage have neither a husband nor a wife?
Tel: +44 1489 880185
Mobile: +44 750 3385279
This email originates from Information Junction Ltd. Registered in England and Wales No. 6632177.
Registered office: 2 Brookside, Meadow Way, Letchworth Garden City, Hertfordshire, SG6 3JE.
In an earlier email I raised the question of how to embed the diagram below into FOL and OWL, as well as any additonal assumptions regarding the diagram and any axiomitization needed to ensure that any structure conforming to the diagram had the three individuals and relationships. One could describe what is being looked for as a template.
An FOL encoding might use unary predicates, Marriage(x), Male(x), and Female(x). One further assumption needed to obtain the template result would be that males and females are disjoint. While I am sure some will correctly point out that the assumption is false in the real world of people it is a tenable assumption for manufactured components with male and female ports and connections which can connect a female port to a male port. A bit of quality control can generally make this tenable.
Anybody have any further ideas where to go. If this is too easy, how about replacing Male and Female with components which have male and female ports.
Message Archives: http://ontolog.cim3.net/forum/model-challenge/
Shared Files: http://ontolog.cim3.net/file/work/ModelingBenchmarkChallenge/
89 Worship Street
London EC2A 2BF
Tel: +44 (0) 20 7917 9522
Mob: +44 (0) 7721 420 730
Registered in England and Wales No. 2461068