8 search results - page 1 / 2 » Deciding the Satisfiability of Propositional Formulas in Fin... |
ISMVL
2008
IEEE
13 years 10 months ago
2008
IEEE
LATA
2010
Springer
14 years 1 months ago
2010
Springer
Abstract. Iterated schemata allow to define infinite languages of propositional formulae through formulae patterns. Formally, schemata extend propositional logic with new (generali...
AI
2008
Springer
13 years 4 months ago
2008
Springer
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...
IJCAI
2001
13 years 5 months ago
2001
The implementation of effective reasoning tools for deciding the satisfiability of Quantified Boolean Formulas (QBFs) is an important research issue in Artificial Intelligence. Ma...
CADE
2007
Springer
14 years 4 months ago
2007
Springer
Manna and Pnueli have extensively shown how a mixture of first-order logic (FOL) and discrete Linear time Temporal Logic (LTL) is sufficient to precisely state verification problem...