119 search results - page 5 / 24 » Tree-Width for First Order Formulae |
FOSSACS
2005
Springer
14 years 19 days ago
2005
Springer
Separation logic is a spatial logic for reasoning locally about heap structures. A decidable fragment of its assertion language was presented in [1], based on a bounded model prope...
GG
2004
Springer
14 years 14 days ago
2004
Springer
We show how edge-labelled graphs can be used to represent first-order logic formulae. This gives rise to recursively nested structures, in which each level of nesting corresponds ...
FUIN
2007
13 years 7 months ago
2007
Mazurkiewicz traces form a model for concurrency. Temporal logic st-order logic are important tools in order to deal with the abstract behavior of such systems. Since typical prop...
ACL
1990
13 years 8 months ago
1990
In contrast to the "designer logic" approach, this paper shows how the attribute-value feature structures of unification grammar and constraints on them can be axiomatiz...
ECAI
2010
Springer
13 years 8 months ago
2010
Springer
We introduce First Order ProbLog, an extension of first order logic with soft constraints where formulas are guarded by probabilistic facts. The paper defines a semantics for FOPro...