Sciweavers

778 search results - page 42 / 156
» Expressiveness and complexity of graph logic
Sort
View
118
Voted
ASP
2003
Springer
15 years 5 months ago
Parametric Connectives in Disjunctive Logic Programming
Disjunctive Logic Programming (DLP) is an advanced formalism for Knowledge Representation and Reasoning (KRR). DLP is very expressive in a precise mathematical sense: it allows to ...
Nicola Leone, Simona Perri
120
Voted
FOSSACS
2010
Springer
15 years 7 months ago
Counting CTL
This paper presents a range of quantitative extensions for the temporal logic CTL. We enhance temporal modalities with the ability to constrain the number of states satisfying cert...
François Laroussinie, Antoine Meyer, Eudes ...
73
Voted
ECAI
2008
Springer
15 years 2 months ago
XTT+ Rule Design Using the ALSV(FD)
This paper presents advances in Set Attributive Logic and its application to develop tabular rule-based systems within the XTT framework. The primary goal is to extend the expressi...
Grzegorz J. Nalepa, Antoni Ligeza
POPL
1993
ACM
15 years 4 months ago
Graph Types
e data structures are abstractions of simple records and pointers. They impose a shape invariant, which is verified at compiletime and exploited to automatically generate code fo...
Nils Klarlund, Michael I. Schwartzbach
94
Voted
CAV
2004
Springer
99views Hardware» more  CAV 2004»
15 years 6 months ago
Range Allocation for Separation Logic
Abstract. Separation Logic consists of a Boolean combination of predicates of the form vi ≥ vj +c where c is a constant and vi, vj are variables of some ordered infinite type li...
Muralidhar Talupur, Nishant Sinha, Ofer Strichman,...