3440 search results - page 348 / 688 » Logics For Context-Free Languages |
196
click to vote
FOAL
2007
ACM
15 years 11 months ago
2007
ACM
The relation between aspects and monads is a recurring topic in discussions in the programming language community, although it has never been elaborated whether their resemblences...
183
click to vote
CAV
1999
Springer
15 years 12 months ago
1999
Springer
BDDs and their algorithms implement a decision procedure for Quanti ed Propositional Logic. BDDs are a kind of acyclic automata. Unrestricted automata (recognizing unbounded string...
199
click to vote
CSL
2006
Springer
15 years 11 months ago
2006
Springer
The goal of this note is to provide a background and references for the invited lecture presented at Computer Science Logic 2006. We briefly discuss motivations that led to the eme...
215
click to vote
SEMWEB
2007
Springer
16 years 1 months ago
2007
Springer
Classical ontologies are not suitable to represent imprecise nor uncertain pieces of information. As a solution we will combine fuzzy Description Logics with a possibilistic layer....
195
click to vote
JSYML
2010
15 years 6 months ago
2010
Continuous first-order logic has found interest among model theorists who wish to extend the classical analysis of “algebraic” structures (such as fields, group, and graphs) ...