Sciweavers

1117 search results - page 93 / 224
» Partial Models of Extended Generalized Logic Programs
Sort
View
POPL
2012
ACM
13 years 9 months ago
Higher-order functional reactive programming in bounded space
Functional reactive programming (FRP) is an elegant and successful approach to programming reactive systems declaratively. The high levels of abstraction and expressivity that mak...
Neelakantan R. Krishnaswami, Nick Benton, Jan Hoff...
VLDB
1990
ACM
143views Database» more  VLDB 1990»
15 years 5 months ago
Synthesizing Database Transactions
Database programming requires having the knowledge of database semantics both to maintain database integrity and to explore more optimization opportunities. Automated programming ...
Xiaolei Qian
DAGSTUHL
1998
15 years 2 months ago
Active-U-Datalog: Integrating Active Rules in a Logical Update Language
Deductive database technology represents an important step towards the goal of developing highly-declarative database programming languages. In order to make deductive databases a ...
Elisa Bertino, Barbara Catania, Vincenzo Gervasi, ...
LOGCOM
2010
120views more  LOGCOM 2010»
14 years 8 months ago
Paraconsistent Machines and their Relation to Quantum Computing
We describe a method to axiomatize computations in deterministic Turing machines (TMs). When applied to computations in non-deterministic TMs, this method may produce contradictor...
Juan C. Agudelo, Walter Alexandre Carnielli
LPNMR
2007
Springer
15 years 7 months ago
GrinGo : A New Grounder for Answer Set Programming
We describe a new grounder system for logic programs under answer set semantics, called GrinGo. Our approach combines and extends techniques from the two primary grounding approach...
Martin Gebser, Torsten Schaub, Sven Thiele