Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 230,697,562 papers from all fields of science
Search
Sign In
Create Free Account
Conjunctive grammar
Known as:
Conjunctive grammars
Conjunctive grammars are a class of formal grammarsstudied in formal language theory.They extend the basic type of grammars,the context-free grammars…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
10 relations
Boolean grammar
CYK algorithm
Comparison of parser generators
DLT
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Parser combinators for context-free path querying
Ekaterina Verbitskaia
,
I. Kirillov
,
Ilya Nozkin
,
S. Grigorev
SCALA@ICFP
2018
Corpus ID: 52294998
Transparent integration of a domain-specific language for specification of context-free path queries (CFPQs) into a general…
Expand
2014
2014
Regular path queries on graphs with data: A rigid approach
Zhilin Wu
arXiv.org
2014
Corpus ID: 15988626
Regular path queries (RPQ) is a classical navigational query formalism for graph databases to specify constraints on labeled…
Expand
2013
2013
Improved normal form for grammars with one-sided contexts
A. Okhotin
Theoretical Computer Science
2013
Corpus ID: 9199504
2008
2008
Homomorphisms Preserving Linear Conjunctive Languages
A. Okhotin
J. Autom. Lang. Comb.
2008
Corpus ID: 31566489
It is proved that a homomorphism h preserves the class of languages generated by linear conjunctive grammars (equivalently…
Expand
2007
2007
Additive Generators of Discrete Conjunctive Aggregation Operations
G. Mayor
,
J. Monreal
IEEE transactions on fuzzy systems
2007
Corpus ID: 15088126
This paper deals with a class of conjunction-like binary operations defined on a finite totally ordered set. The concept of…
Expand
2007
2007
Distributed Description Logics Revisited
Martin Homola
Description Logics
2007
Corpus ID: 13056675
Distributed Description Logics (DDLs) is a KR formalism that enables reasoning with multiple ontologies interconnected by…
Expand
Review
2007
Review
2007
Nine Open Problems on Conjunctive and Boolean Grammars
A. Okhotin
Bull. EATCS
2007
Corpus ID: 11639501
Conjunctive grammars are context-free grammars with an explicit conjunction operation in the formalism of rules; Boolean grammars…
Expand
Review
2003
Review
2003
An overview of conjunctive grammars
A. Okhotin
2003
Corpus ID: 8838090
AbstractConjunctive grammars were introduced in 2000 as a generalization ofcontext-free grammars that allows the use of an…
Expand
2003
2003
Conjunctive languages are closed under inverse homomorphism
A. Okhotin
2003
Corpus ID: 5718161
It is proved that the inverse homomorphic image of every language generated by a conjunctive grammar can be generated by a…
Expand
2003
2003
The hardest linear conjunctive language
A. Okhotin
Information Processing Letters
2003
Corpus ID: 5227627
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE