Sciweavers

607 search results - page 42 / 122
» Axiomatizing hybrid logic using modal logic
Sort
View
ENTCS
2008
98views more  ENTCS 2008»
14 years 9 months ago
Modal Expressiveness of Graph Properties
Graphs are among the most frequently used structures in Computer Science. In this work, we analyze how we can express some important graph properties such as connectivity, acyclic...
Mario R. F. Benevides, L. Menasché Schechte...
APAL
2004
91views more  APAL 2004»
14 years 9 months ago
First-order intensional logic
First-order modal logic is very much under current development, with many different semantics proposed. The use of rigid objects goes back to Saul Kripke. More recently several se...
Melvin Fitting
STOC
2009
ACM
106views Algorithms» more  STOC 2009»
15 years 10 months ago
An axiomatic approach to algebrization
Non-relativization of complexity issues can be interpreted as giving some evidence that these issues cannot be resolved by "black-box" techniques. In the early 1990'...
Russell Impagliazzo, Valentine Kabanets, Antonina ...
TIME
1999
IEEE
15 years 2 months ago
TALplanner: An Empirical Investigation of a Temporal Logic-Based Forward Chaining Planner
We present a new forward chaining planner, TALplanner, based on ideas developed by Bacchus [5] and Kabanza [11], where domain-dependent search control knowledge represented as tem...
Patrick Doherty, Jonas Kvarnström
ATVA
2010
Springer
217views Hardware» more  ATVA 2010»
14 years 11 months ago
LTL Can Be More Succinct
Abstract. It is well known that modelchecking and satisfiability of Linear Temporal Logic (LTL) are Pspace-complete. Wolper showed that with grammar operators, this result can be e...
Kamal Lodaya, A. V. Sreejith