4617 search results - page 719 / 924 » Automation of Diagrammatic Reasoning |
164
click to vote
TPHOL
2005
IEEE
16 years 22 days ago
2005
IEEE
Using the HOL theorem prover, we proved the correctness of a translation from a subset of Accellera’s property specification language PSL to linear temporal logic LTL. Moreover,...
209
click to vote
ASP
2005
Springer
16 years 21 days ago
2005
Springer
In this paper we develop a declarative language for modular answer set programming (ASP). Our language allows to declaratively state how one ASP module can import processed answer ...
225
click to vote
ASP
2005
Springer
16 years 21 days ago
2005
Springer
Answer Set Programming (ASP) and propositional satisfiability (SAT) are closely related. In some recent work we have shown that, on a wide set of logic programs called “tight”...
221
click to vote
ASP
2005
Springer
16 years 21 days ago
2005
Springer
This paper studies compositional semantics of nonmonotonic logic programs. We suppose the answer set semantics of extended disjunctive programs and consider the following problem. ...
186
click to vote
CSL
2005
Springer
16 years 21 days ago
2005
Springer
We study computability on sequence spaces, as they are used in functional analysis. It is known that non-separable normed spaces cannot be admissibly represented on Turing machines...