Difference between revisions of "Simplified Common Logic"
DavidWhitten (talk | contribs) (→SCL Overview) |
DavidWhitten (talk | contribs) |
||
| Line 8: | Line 8: | ||
=== SCL Overview === | === SCL Overview === | ||
| − | {{SCL/For_Harry/1}} | + | {{:SCL/For_Harry/1}} |
| − | {{SCL/For_Harry/2}} | + | {{:SCL/For_Harry/2}} |
| − | {{SCL/For_Harry/3}} | + | {{:SCL/For_Harry/3}} |
| − | {{SCL/For_Harry/4}} | + | {{:SCL/For_Harry/4}} |
| − | {{SCL/For_Harry/5}} | + | {{:SCL/For_Harry/5}} |
| − | {{SCL/For_Harry/6}} | + | {{:SCL/For_Harry/6}} |
| − | {{SCL/For_Harry/7}} | + | {{:SCL/For_Harry/7}} |
| − | {{SCL/For_Harry/8}} | + | {{:SCL/For_Harry/8}} |
| − | {{SCL/For_Harry/9}} | + | {{:SCL/For_Harry/9}} |
| − | {{SCL/For_Harry/10}} | + | {{:SCL/For_Harry/10}} |
| − | {{SCL/For_Harry/11}} | + | {{:SCL/For_Harry/11}} |
| − | {{SCL/For_Harry/12}} | + | {{:SCL/For_Harry/12}} |
| − | {{SCL/For_Harry/13}} | + | {{:SCL/For_Harry/13}} |
| − | {{SCL/For_Harry/14}} | + | {{:SCL/For_Harry/14}} |
| − | {{SCL/For_Harry/15}} | + | {{:SCL/For_Harry/15}} |
| − | {{SCL/For_Harry/16}} | + | {{:SCL/For_Harry/16}} |
| − | {{SCL/For_Harry/17}} | + | {{:SCL/For_Harry/17}} |
| − | {{SCL/For_Harry/18}} | + | {{:SCL/For_Harry/18}} |
| − | {{SCL/For_Harry/19}} | + | {{:SCL/For_Harry/19}} |
| − | {{SCL/For_Harry/20}} | + | {{:SCL/For_Harry/20}} |
Latest revision as of 16:46, 26 March 2021
Simplified Common Logic (SCL) is a form of Common Logic with a different emphasis.
There is a slide show at https://www.ihmc.us/users/phayes/SCL_for_Harry.ppt that describes SCL (local copy File:SCL for Harry.ppt .
This wiki has those slides duplicated here, with the option of enhancing them.
Contents
SCL Overview
Simplified Common Logic
A flexible framework for information interchange based on first-order logic
Simplified Common Logic
| SCL ad-hoc working group (formed Dec 2002): | Pat Hayes | IHMC, US | Christopher Menzel | Texas A&M U., US | John Sowa | VivoMind, US | Tanel Tammet | U. Goteborg, Sweden | Bill Anderson | OntologyWorks, US | Murray Altheim | Open University, UK | Harry Delugach | U. of Alabama, US |
conventional First-Order Logic
- Lexicon fixed by signature
- Lexicon is pre-sorted into relation/function/individual names
- One context-free syntax for expressing logical forms
- Only ‘pure’ logical forms allowed
- No relations in the universe of discourse
- No global naming scheme
conventional First-Order Logic (GOFOL)
- Lexicon fixed by signature
- Lexicon is pre-sorted into relation/function/individual names
- One context-free syntax for expressing logical forms
- Only ‘pure’ logical forms allowed
- No relations in the universe of discourse
- No global naming scheme
All of this causes problems for interoperability and information exchange None of it is actually required by the FO semantics
conventional First-Order Logic (SCL)
-
Lexicon fixed by signatureNo signature required -
Lexicon is pre-sorted into relation/function/individual namesLexical categories implicit -
One context-free syntax for expressing logical formsSyntactic options may be user-defined -
Only ‘pure’ logical forms allowed SCLcan be intermixed with other content, including XML markup -
No relations in the universe of discourseNo restrictions on universe of quantification -
No global naming schemeUses WWW standard URI conventions
SCL is first-order logic with syntactic limitations removed and network use in mind.
SCL/For Harry/6
SCL/For Harry/7
SCL/For Harry/8
SCL/For Harry/9
SCL/For Harry/10
SCL/For Harry/11
SCL/For Harry/12
SCL/For Harry/13
SCL/For Harry/14
SCL/For Harry/15
SCL/For Harry/16
SCL/For Harry/17
SCL/For Harry/18
SCL/For Harry/19
SCL/For Harry/20
