3440 search results - page 409 / 688 » Logics For Context-Free Languages |
196
click to vote
ENTCS
2008
15 years 7 months ago
2008
Deep inference is a proof theoretical methodology that generalizes the traditional notion of inference in the sequent calculus: in contrast to the sequent calculus, the deductive ...
188
click to vote
IGPL
2006
15 years 7 months ago
2006
Abduction or retroduction, as introduced by C.S. Peirce in the double sense of searching for explanatory instances and providing an explanation (i.e., involving the procedure of s...
211
click to vote
IPL
2008
15 years 7 months ago
2008
Undefined terms involving the application of partial functions and operators are common in program specifications and in discharging proof obligations that arise in design. One wa...
233
click to vote
ENTCS
2007
15 years 7 months ago
2007
We introduce the idea of optimisation validation, which is to formally establish that an instance of an optimising transformation indeed improves with respect to some resource mea...
235
click to vote
JAPLL
2007
15 years 7 months ago
2007
We extend answer set programming (ASP) with, possibly infinite, open domains. Since this leads to undecidable reasoning, we restrict the syntax of programs, while carefully guard...