Handling termination in a logical language for active rules
From Semantic Portal Wiki
{{#vardefine:category|Publication}}{{#vardefine:templatename|i.publication}}{{#vardefine:package|smwbp_instance_templates}}
| Edit |
Reference: {{#vardefine:pagename|handling termination in a logical language for active rules }}
- [[]]
bibtex
{{#vardefine:pagename|Handling termination in a logical language for active rules }}{{#vardefine:key| }}
abstract:
download:
- paper:
- slides:
Facts about Handling termination in a logical language for active rulesRDF feed
| Author | Bertram Lud\"ascher +, and Georg Lausen + |
| Bibtype | article + |
| Doi | http://www.vtex.lt/informatica/htm/INFO115.htm + |
| Journal | Informatica, Lith. Acad. Sci. + |
| Key | dblp:journals/informaticalt/ludascherl98 + |
| Number | 1 + |
| Pages | 65-84 + |
| Source | http://dblp.uni-trier.de/rec/bibtex/journals/informaticaLT/LudascherL98 + |
| Tag | Computer science + |
| Title | Handling Termination in a Logical Language for Active Rules + |
| Volume | 9 + |
| Year | 1998 + |
