User loginNavigation |
Extended Axiomatic LanguageAxiomatic language is a formal system for specifying recursively enumerable sets of hierarchical symbolic expressions. But axiomatic language does not have negation. Extended axiomatic language is based on the idea that when one specifies a recursively enumerable set, one is simultaneously specifying the complement of that set (which may not be recursively enumerable). This complement set can be useful for specification. Extended axiomatic language makes use of this complement set and can be considered a form of logic programming negation. The web page defines the language and gives examples. By Walter W. Wilson at 2014-09-17 19:28 | LtU Forum | previous forum topic | next forum topic | other blogs | 3461 reads
|
Browse archives
Active forum topics |
Recent comments
22 weeks 6 days ago
22 weeks 6 days ago
22 weeks 6 days ago
45 weeks 22 hours ago
49 weeks 2 days ago
51 weeks 47 min ago
51 weeks 51 min ago
1 year 1 week ago
1 year 6 weeks ago
1 year 6 weeks ago