Sciweavers

2062 search results - page 134 / 413
» Derivatives of Logical Formulas
Sort
View
CORR
1999
Springer
95views Education» more  CORR 1999»
15 years 3 months ago
Fixed-parameter tractability, definability, and model checking
In this article, we study parameterized complexity theory from the perspective of logic, or more specifically, descriptive complexity theory. We propose to consider parameterized ...
Jörg Flum, Martin Grohe
JAIR
2012
211views Hardware» more  JAIR 2012»
13 years 6 months ago
Reformulating the Situation Calculus and the Event Calculus in the General Theory of Stable Models and in Answer Set Programming
Circumscription and logic programs under the stable model semantics are two wellknown nonmonotonic formalisms. The former has served as a basis of classical logic based action for...
Joohyung Lee, Ravi Palla
ICLP
2004
Springer
15 years 9 months ago
Termination of Logic Programs Using Various Dynamic Selection Rules
Abstract. We study termination of logic programs with dynamic scheduling, as it can be realised using delay declarations. Following previous work, our minimum assumption is that de...
Jan-Georg Smaus
LFCS
2007
Springer
15 years 10 months ago
Realizations and LP
LP can be seen as a logic of knowledge with justifications. Artemov’s Realization Theorem says justifications can be extracted from validities in the more conventional Hintikk...
Melvin Fitting
RV
2007
Springer
100views Hardware» more  RV 2007»
15 years 10 months ago
The Good, the Bad, and the Ugly, But How Ugly Is Ugly?
When monitoring a system wrt. a property defined in some temporal logic, e. g., LTL, a major concern is to settle with an adequate interpretation of observable system events; that...
Andreas Bauer 0002, Martin Leucker, Christian Scha...