101 search results - page 7 / 21 » Some Progress in Satisfiability Checking for Difference Logi... |
CCIA
2009
Springer
13 years 8 months ago
2009
Springer
When an agent receives a query from another agent, it tries to satisfy it by building an answer based on its current knowledge. Depending on the available time or the urgency of t...
EATCS
2000
13 years 7 months ago
2000
Formulas of Hoare logic are asserted programs where is a program and , are assertions. The language of programs varies; in the survey [Apt 1980], one finds the language of wh...
FOSSACS
2008
Springer
13 years 9 months ago
2008
Springer
We study complexity issues related to the model-checking problem for LTL with registers (a.k.a. freeze LTL) over one-counter automata. We consider several classes of one-counter au...
ER
2004
Springer
14 years 24 days ago
2004
Springer
A major issue in the study of semantic Web services concerns the matching problem of Web services. Various techniques for this problem have been proposed. Typical ones include FSM ...
CADE
2009
Springer
14 years 8 months ago
2009
Springer
This paper is concerned with the problem of checking whether a given subset of an unsatisfiable Boolean CNF formula takes part in the basic causes of the inconsistency of . More ...