Sciweavers

2062 search results - page 252 / 413
» Derivatives of Logical Formulas
Sort
View
LICS
2008
IEEE
16 years 16 days ago
On the Asymptotic Nullstellensatz and Polynomial Calculus Proof Complexity
We show that the asymptotic complexity of uniformly generated (expressible in First-Order (FO) logic) propositional tautologies for the Nullstellensatz proof system (NS) as well a...
Søren Riis
183
Voted
CSCLP
2008
Springer
15 years 8 months ago
An Efficient Decision Procedure for Functional Decomposable Theories Based on Dual Constraints
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...
Khalil Djelloul
AI
2008
Springer
15 years 6 months ago
Modelling and solving temporal reasoning as propositional satisfiability
Representing and reasoning about time dependent information is a key research issue in many areas of computer science and artificial intelligence. One of the best known and widely...
Duc Nghia Pham, John Thornton, Abdul Sattar
176
Voted
ASE
2005
137views more  ASE 2005»
15 years 6 months ago
Rewriting-Based Techniques for Runtime Verification
Techniques for efficiently evaluating future time Linear Temporal Logic (abbreviated LTL) formulae on finite execution traces are presented. While the standard models of LTL are i...
Grigore Rosu, Klaus Havelund
178
Voted
KI
2007
Springer
16 years 8 days ago
Spatio-Temporal Configurations of Dynamics Points in a 1D Space
This paper describes a spatio-temporal configurations building approach, which has been applied to dynamics points in 1-dimensional space. In this approach, a temporal logic, Allen...
Pierre Hallot, Roland Billen