778 search results - page 53 / 156 » Expressiveness and complexity of graph logic |
96
Voted
ICALP
2009
Springer
16 years 25 days ago
2009
Springer
The IEEE standardized Property Specification Language, PSL for short, extends the well-known linear-time temporal logic LTL with so-called semi-extended regular expressions. PSL an...
106
click to vote
FUZZY
2001
Springer
15 years 5 months ago
2001
Springer
This work studies the edge-based representation of directed acyclic graphs, as well as the properties of recombination operators working on it. It is shown that this representation...
101
click to vote
UAI
2003
15 years 1 months ago
2003
We introduce a logic for reasoning about evidence that essentially views evidence as a function from prior beliefs (before making an observation) to posterior beliefs (after makin...
101
click to vote
CAISE
2004
Springer
15 years 6 months ago
2004
Springer
tween documents. They should allow for an abstract representation of data which resembles the way they are actually perceived and used in the real world, thus shortening (with resp...
121
click to vote
CCL
1994
Springer
15 years 4 months ago
1994
Springer
Abstract: This paper describes the application of CLP (constraint logic programming) to several digital circuit design problems. It is shown that logic programming together with ef...