Sciweavers

1020 search results - page 100 / 204
» Tight Semantics for Logic Programs
Sort
View
CORR
2002
Springer
87views Education» more  CORR 2002»
13 years 8 months ago
Ultimate approximations in nonmonotonic knowledge representation systems
We study xpoints of operators on lattices. To this end we introduce the notion of an approximation of an operator. We order approximations by means of a precision ordering. We sho...
Marc Denecker, V. Wiktor Marek, Miroslaw Truszczyn...
JELIA
2000
Springer
14 years 16 days ago
A Logic for Modeling Decision Making with Dynamic Preferences
We present a framework for decision making with the possibility to express circumstance-dependent preferences among different alternatives for a decision. This new formalism, Order...
Marina De Vos, Dirk Vermeir
LPNMR
1993
Springer
14 years 1 months ago
Negation as Partial Failure
We present a logic programming language which uses a four-valued bilattice as the underlying framework for semantics of programs. The two orderings of the bilattice reflect the c...
Bamshad Mobasher, Jacek Leszczylowski, Don Pigozzi
POPL
2008
ACM
14 years 9 months ago
Formal verification of translation validators: a case study on instruction scheduling optimizations
Translation validation consists of transforming a program and a posteriori validating it in order to detect a modification of its semantics. This approach can be used in a verifie...
Jean-Baptiste Tristan, Xavier Leroy
VLDB
1990
ACM
143views Database» more  VLDB 1990»
14 years 1 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