Sciweavers

240 search results - page 7 / 48
» Constrained Partial Deduction
Sort
View
DAC
2007
ACM
14 years 8 months ago
Alembic: An Efficient Algorithm for CNF Preprocessing
Satisfiability (SAT) solvers often benefit from a preprocessing of the formula to be decided. For formulae in conjunctive normal form (CNF), subsumed clauses may be removed or par...
HyoJung Han, Fabio Somenzi
IDEAS
1997
IEEE
107views Database» more  IDEAS 1997»
13 years 11 months ago
Query Processing in the ROL system
The ROL system is a novel deductive object-oriented database system that has been implemented at the University of Regina. It provides a uniform rule-based declarative language fo...
Mengchi Liu, Weidong Yu
ATAL
2006
Springer
13 years 11 months ago
Symbolic negotiation revisited
In this paper we propose a formalism for symbolic negotiation. We regard symbolic negotiation as cooperative problem solving (CPS), which is based on symbolic reasoning and is ext...
Peep Küngas, Mihhail Matskin
BIRTHDAY
2005
Springer
14 years 1 months ago
Compiled Labelled Deductive Systems for Access Control
This paper proposes a Compiled Labelled Deductive System, called ACCLDS, for reasoning about role-based access control in distributed systems, which builds upon Massacci’s tablea...
Krysia Broda, Alessandra Russo
IIE
2008
97views more  IIE 2008»
13 years 7 months ago
Mathematical Logic and Deduction in Computer Science Education
Mathematical logic is a discipline used in sciences and humanities with different point of view. Although in tertiary level computer science education it has a solid place, it does...
Hashim Habiballa, Tibor Kmet