Well-founded semantics for Boolean grammars-Reference-Cited by-同舟云学术

Well-founded semantics for Boolean grammars

Published:2009-09 Issue:9 Volume:207 Page:945-967
ISSN:0890-5401
Container-title:Information and Computation
language:en
Short-container-title:Information and Computation

Author:

Kountouriotis Vassilis,Nomikos Christos,Rondogiannis Panos

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science

Reference14 articles.

1. Logic programming and negation: a survey;Apt;Journal of Logic Programming,1994

2. Boolean fuzzy sets;Esik;International Journal of Foundations of Computer Science,2007

3. A Mathematical Introduction to Logic;Enderton,1972

4. V. Kountouriotis, Ch. Nomikos, P. Rondogiannis, Well-founded semantics for Boolean grammars, in: Tenth International Conference on Developments in Language Theory (DLT), 2006, pp. 203–214.

5. Ch. Nomikos, P. Rondogiannis, Locally stratified Boolean grammars, in: First International Conference on Language and Automata Theory and Applications (LATA), 2007, pp. 437–447.

Cited by 26 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A GLR-like Parsing Algorithm for Three-Valued Interpretations of Boolean Grammars with Strong Negation;Electronic Proceedings in Theoretical Computer Science;2024-09-11

2. Derivatives of Context-free Grammars with Lookahead;Journal of Information Processing;2023

3. A Fixed Point Theorem on Lexicographic Lattice Structures;Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science;2020-07-08

4. Hardest languages for conjunctive and Boolean grammars;Information and Computation;2019-06

5. Linear-space recognition for grammars with contexts;Theoretical Computer Science;2018-04