Sciweavers

6149 search results - page 46 / 1230
» Revealing the programming process
Sort
View
AI
2006
Springer
15 years 20 days ago
Solving logic program conflict through strong and weak forgettings
We consider how to forget a set of atoms in a logic program. Intuitively, when a set of atoms is forgotten from a logic program, all atoms in the set should be eliminated from thi...
Yan Zhang, Norman Y. Foo
116
Voted
TSE
2011
145views more  TSE 2011»
14 years 7 months ago
Semi-Proving: An Integrated Method for Program Proving, Testing, and Debugging
— We present an integrated method for program proving, testing, and debugging. Using the concept of metamorphic relations, we select necessary properties for target programs. For...
Tsong Yueh Chen, T. H. Tse, Zhiquan Zhou
146
Voted
OL
2011
217views Neural Networks» more  OL 2011»
14 years 7 months ago
Privacy-preserving linear programming
Abstract. We propose a privacy-preserving formulation of a linear program whose constraint matrix is partitioned into groups of columns where each group of columns and its correspo...
O. L. Mangasarian
199
Voted
ICLP
2009
Springer
16 years 1 months ago
Merging Logic Programs under Answer Set Semantics
This paper considers a semantic approach for merging logic programs under answer set semantics. Given logic programs P1, . . . , Pn, the goal is to provide characterisations of the...
James P. Delgrande, Torsten Schaub, Hans Tompits, ...
92
Voted
FASE
2009
Springer
15 years 7 months ago
A Formal Connection between Security Automata and JML Annotations
Security automata are a convenient way to describe security policies. Their typical use is to monitor the execution of an application, and to interrupt it as soon as the security p...
Marieke Huisman, Alejandro Tamalet