2649 search results - page 181 / 530 » Temporal Theories of Reasoning |
166
click to vote
FASE
2010
Springer
16 years 1 months ago
2010
Springer
Abstract. Abstraction is essential in the formal specification of programs. A common way of writing abstract specifications is to specify implementations in terms of basic mathem...
191
click to vote
CSL
2007
Springer
16 years 24 days ago
2007
Springer
Calculi with explicit substitutions (ES) are widely used in different areas of computer science. Complex systems with ES were developed these last 15 years to capture the good comp...
198
click to vote
ILP
2007
Springer
16 years 23 days ago
2007
Springer
Mode declarations are a successful form of language bias in explanatory ILP. But, while they are heavily used in Horn systems, they have yet to be similarly exploited in more expre...
176
click to vote
FOSSACS
2005
Springer
16 years 4 days ago
2005
Springer
Abstract. Nominal logic is a variant of first-order logic equipped with a “freshname quantifier” N and other features useful for reasoning about languages with bound names. I...
138
click to vote
COMPSAC
2009
IEEE
15 years 11 months ago
2009
IEEE
Non-terminating programs are programs that legally perform unbounded computations. Though they are ubiquitous in real-world applications, testing these programs requires new theor...