OASIS Mailing List ArchivesView the OASIS mailing list archive below
or browse/search using MarkMail.

 


Help: OASIS Mailing Lists Help | MarkMail Help

 


 

   Re: [xml-dev] Logical markup Language

[ Lists Home | Date Index | Thread Index ]

The Schematron schema language lets you test logical statements
about a document tree and providing detailed natural language
statements, including statements with queried values embedded.

It is a rule-chaining language (no backtracking) so it might not be
what you are thinking of as a "logical markup language" but it
seems to fulfill all your criteria.

The rule syntax is XML. The logic syntax is XPath. 

It was developed at the Computing Centre of the prestige Taiwanese research
institution Academia Sinica (ASCC), and several other researches developed
similar approaches independently at the same time (XLinkit, XCSL).
It currently undergoing ISO standardization.  

The main references are:
     RDDL directory  http://www.ascc.net/xml/schematron
     ASCC  page http://www.ascc.net/xml/resource/schematron/schematron.html

My company, Topologi, offers a free Windows-based tool for it,
but the code is open source.  A new version with some improvements
is currently under progress.
     Topologi  http://www.topologi.com/

Cheers
Rick Jelliffe

----- Original Message ----- 
From: "Trevor Croll" <trevorcroll@fastmail.fm>
To: <xml-dev@lists.xml.org>
Sent: Monday, June 24, 2002 9:09 AM
Subject: [xml-dev] Logical markup Language


> There does not seem to be a logical markup language, A language where a
> problem  or a set of problems can be defined as a tree of options where the
> nodes of the tree state the logical operation that should be applied to the
> sub nodes and attributes indicate the state of the nodes such as true or
> false such that a recursive decent can determine a truth about the tree.
> 
> Is ther such a beast, could there be one as a subset of another markup
> specification.
> 
> In many situations if A and B then true, but B could be C or D or E or F,
> and F could be Not G and Not H
> 
> I know there are other ways of doing this but there could be a sentence
> attached to A explaining what happened and why this should be true, and when
> the tree is parsed and displayed a complete logical sentence could be
> produced that verifies the truth/False result
> 
> Trevor Croll
> 
> 
> -----------------------------------------------------------------
> The xml-dev list is sponsored by XML.org <http://www.xml.org>, an
> initiative of OASIS <http://www.oasis-open.org>
> 
> The list archives are at http://lists.xml.org/archives/xml-dev/
> 
> To subscribe or unsubscribe from this list use the subscription
> manager: <http://lists.xml.org/ob/adm.pl>
> 
>




 

News | XML in Industry | Calendar | XML Registry
Marketplace | Resources | MyXML.org | Sponsors | Privacy Statement

Copyright 2001 XML.org. This site is hosted by OASIS