Sciweavers

174 search results - page 13 / 35
» Existential Fixed-Point Logic
Sort
View
AAAI
2012
13 years 10 days ago
Equality-Friendly Well-Founded Semantics and Applications to Description Logics
We tackle the problem of defining a well-founded semantics (WFS) for Datalog rules with existentially quantified variables in their heads and negations in their bodies. In partic...
Georg Gottlob, André Hernich, Clemens Kupke...
CSR
2010
Springer
15 years 2 months ago
Frameworks for Logically Classifying Polynomial-Time Optimisation Problems
We show that a logical framework, based around a fragment of existential second-order logic formerly proposed by others so as to capture the class of polynomially-bounded P-optimi...
James Gate, Iain A. Stewart
ICALP
2007
Springer
15 years 1 months ago
Affine Systems of Equations and Counting Infinitary Logic
We study the definability of constraint satisfaction problems (CSP) in various fixed-point and infinitary logics. We show that testing the solvability of systems of equations over...
Albert Atserias, Andrei A. Bulatov, Anuj Dawar
FUIN
2010
172views more  FUIN 2010»
14 years 7 months ago
Bounded Parametric Verification for Distributed Time Petri Nets with Discrete-Time Semantics
Bounded Model Checking (BMC) is an efficient technique applicable to verification of temporal properties of (timed) distributed systems. In this paper we show for the first time ho...
Michal Knapik, Wojciech Penczek, Maciej Szreter, A...
FOSSACS
2003
Springer
15 years 3 months ago
Type Assignment for Intersections and Unions in Call-by-Value Languages
We develop a system of type assignment with intersection types, union types, indexed types, and universal and existential dependent types that is sound in a call-by-value functiona...
Joshua Dunfield, Frank Pfenning