5506 search results - page 341 / 1102 » Minimal Logic Programs |
126
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 ...
165
click to vote
POPL
2012
ACM
14 years 14 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...
127
Voted
BSL
2004
15 years 4 months ago
2004
This paper ties together much of the model theory of the last 50 years. Shelah's attempts to generalize the Morley theorem beyond first order logic led to the notion of excel...
162
Voted
FPGA
2003
ACM
15 years 10 months ago
2003
ACM
One of the most difficult and time-consuming steps in the creation of an FPGA is its transistor-level design and physical layout. Modern commercial FPGAs typically consume anywher...
158
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...