61 search results - page 4 / 13 » Decidable Cases of First-order Temporal Logic with Functions |
CORR
2004
Springer
13 years 6 months ago
2004
Springer
Abstract. The classical propositional logic is known to be sound and complete with respect to the set semantics that interprets connectives as set operations. The paper extends pro...
FLAIRS
2007
13 years 8 months ago
2007
In this paper, we extend Moss and Parikh’s approach to reasoning about topological properties of knowledge. We turn that system in a spatio-temporal direction by successively ad...
AICOM
2010
13 years 6 months ago
2010
This paper presents an interactive proof method for the verification of temporal properties of concurrent systems based on symbolic execution. Symbolic execution is a well known a...
CSL
2008
Springer
13 years 8 months ago
2008
Springer
Interval logics are an important area of computer science. Although attention has been mainly focused on unary operators, an early work by Venema (1991) introduced an expressively ...
ICLP
2009
Springer
14 years 7 months ago
2009
Springer
When a logic program is processed by an answer set solver, the first task is to generate its instantiation. In a recent paper, Calimeri et el. made the idea of efficient instantiat...