3566 search results - page 274 / 714 » Signed Logic Programs |
138
click to vote
PPDP
2007
Springer
15 years 9 months ago
2007
Springer
The problem of mechanically formalizing and proving metatheoretic properties of programming language calculi, type systems, operational semantics, and related formal systems has r...
131
click to vote
ICFP
2010
ACM
15 years 4 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...
199
click to vote
SLOGICA
2011
14 years 10 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...
110
click to vote
LPNMR
2005
Springer
15 years 8 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 ...
151
click to vote
POPL
2012
ACM
13 years 10 months 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...