1061 search results - page 87 / 213 » Dependently Sorted Logic |
ICLP
1990
Springer
15 years 6 months ago
1990
Springer
Definite Clause Grammars (DCGs) have proved valuable to computational linguists since they can be used to specify phrase structured grammars. It is well known how to encode DCGs i...
123
click to vote
DAIS
2009
15 years 3 months ago
2009
Abstract. Our work focuses on distributed software services and their requirements in terms of system performance and dependability. We target the problem of finding optimal deploy...
128
click to vote
CORR
2008
Springer
15 years 2 months ago
2008
Springer
Many real-world data are maintained in relational format, with different tables storing information about entities and their links or relationships. The structure (schema) of the ...
109
click to vote
CAV
1999
Springer
15 years 6 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...
102
click to vote
APAL
2002
15 years 1 months ago
2002
The paper introduces a semantics for the language of classical first order logic supplemented with the additional operators and . This semantics understands formulas as tasks. An ...