Locally stratified Boolean grammars
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4199656 (Why is no real title available?)
- scientific article; zbMATH DE number 5605108 (Why is no real title available?)
- scientific article; zbMATH DE number 4155872 (Why is no real title available?)
- scientific article; zbMATH DE number 708664 (Why is no real title available?)
- scientific article; zbMATH DE number 1747449 (Why is no real title available?)
- scientific article; zbMATH DE number 2155200 (Why is no real title available?)
- Boolean grammars
- Conjunctive Grammars Can Generate Non-regular Unary Languages
- Conjunctive Grammars over a Unary Alphabet: Undecidability and Unbounded Growth
- Mathematical Foundations of Computer Science 2005
- Minimum model semantics for logic programs with negation-as-failure
- Stratified negation in temporal logic programming and the cycle-sum test
- Temporal stratification tests for linear and branching-time deductive databases
- The well-founded semantics for general logic programs
- Unrestricted complementation in language equations over a one-letter alphabet
- Well-Founded Semantics for Boolean Grammars
Cited in
(5)
This page was built for publication: Locally stratified Boolean grammars
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q948094)