3481 search results - page 316 / 697 » Higher-Order Logic Programming as Constraint Logic Programmi... |
141
click to vote
ICFP
2010
ACM
15 years 5 months ago
2010
ACM
Programmers reason about their programs using a wide variety of formal and informal methods. Programmers in untyped languages such as Scheme or Erlang are able to use any such met...
225
click to vote
SLOGICA
2011
14 years 11 months ago
2011
The paper contains a survey of (mainly unpublished) adaptive logics of inductive generalization. These defeasible logics are precise formulations of certain methods. Some attentio...
124
click to vote
LPNMR
2005
Springer
15 years 10 months ago
2005
Springer
Open answer set programming (OASP) is an extension of answer set programming where one may ground a program with an arbitrary superset of the program’s constants. We define a ...
163
click to vote
POPL
2012
ACM
14 years 3 days ago
2012
ACM
Functional reactive programming (FRP) is an elegant and successful approach to programming reactive systems declaratively. The high levels of abstraction and expressivity that mak...
150
click to vote
SAC
2010
ACM
15 years 2 months ago
2010
ACM
Verification conditions (VCs) are logical formulae whose validity implies the correctness of a program with respect to a specification. The technique of checking software properti...