109 search results - page 15 / 22 » Characterization of Logics over Ranked Tree Languages |
203
click to vote
ICLP
2009
Springer
16 years 14 days ago
2009
Springer
Over the years, the stable-model semantics has gained a position of the correct (two-valued) interpretation of default negation in programs. However, for programs with aggregates (...
125
click to vote
PEPM
2011
ACM
14 years 2 months ago
2011
ACM
Navigating through tree structures is a core operation in tree processing programs. Most notably, XML processing programs intensively use XPath, the path specification language t...
136
click to vote
ICDT
2010
ACM
15 years 3 months ago
2010
ACM
Stochastic context-free grammars (SCFGs) have long been recognized as useful for a large variety of tasks including natural language processing, morphological parsing, speech reco...
102
click to vote
CADE
2008
Springer
16 years 4 days ago
2008
Springer
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are int...
128
click to vote
ENTCS
2002
14 years 11 months ago
2002
In this paper, we develop the notion of fuzzy unification and incorporate it into a novel fuzzy argumentation framework for extended logic programming. We make the following contri...