Sciweavers

1061 search results - page 87 / 213
» Dependently Sorted Logic
Sort
View
ICLP
1990
Springer
14 years 2 months ago
Extending Definite Clause Grammars with Scoping Constructs
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...
Remo Pareschi, Dale Miller
DAIS
2009
13 years 11 months ago
Foraging for Better Deployment of Replicated Service Components
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...
Máté J. Csorba, Hein Meling, Poul E....
CORR
2008
Springer
143views Education» more  CORR 2008»
13 years 10 months ago
Join Bayes Nets: A new type of Bayes net for relational data
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 ...
Oliver Schulte, Hassan Khosravi, Flavia Moser, Mar...
CAV
1999
Springer
119views Hardware» more  CAV 1999»
14 years 2 months ago
A Theory of Restrictions for Logics and Automata
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...
Nils Klarlund
APAL
2002
101views more  APAL 2002»
13 years 10 months ago
The logic of tasks
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 ...
Giorgi Japaridze