Sciweavers

145 search results - page 24 / 29
» Parameterized Complexity Classes under Logical Reductions
Sort
View
FUIN
2007
135views more  FUIN 2007»
13 years 8 months ago
On First-Order Fragments for Mazurkiewicz Traces
Mazurkiewicz traces form a model for concurrency. Temporal logic st-order logic are important tools in order to deal with the abstract behavior of such systems. Since typical prop...
Volker Diekert, Martin Horsch, Manfred Kufleitner
TPLP
2002
117views more  TPLP 2002»
13 years 8 months ago
On Properties of Update Sequences Based on Causal Rejection
In this paper, we consider an approach to update nonmonotonic knowledge bases represented as extended logic programs under the answer set semantics. In this approach, new informat...
Thomas Eiter, Michael Fink, Giuliana Sabbatini, Ha...
CORR
2008
Springer
179views Education» more  CORR 2008»
13 years 8 months ago
Practical Automated Partial Verification of Multi-Paradigm Real-Time Models
This article introduces a fully automated verification technique that permits to analyze real-time systems described using a continuous notion of time and a mixture of operational...
Carlo A. Furia, Matteo Pradella, Matteo Rossi
CSL
2008
Springer
13 years 10 months ago
Quantified Positive Temporal Constraints
Abstract. A positive temporal template (or a positive temporal constraint language) is a relational structure whose relations can be defined over countable dense linear order witho...
Witold Charatonik, Michal Wrona
AI
2008
Springer
13 years 8 months ago
What makes propositional abduction tractable
Abduction is a fundamental form of nonmonotonic reasoning that aims at finding explanations for observed manifestations. This process underlies many applications, from car configu...
Gustav Nordh, Bruno Zanuttini