Sciweavers

5506 search results - page 28 / 1102
» Minimal Logic Programs
Sort
View
IAT
2009
IEEE
14 years 2 months ago
Computing Information Minimal Match Explanations for Logic-Based Matchmaking
Abstract—In semantic matchmaking processes it is often useful, when the obtained match is not full, to provide explanations for the mismatch, to leverage further interaction and/...
Tommaso Di Noia, Eugenio Di Sciascio, Francesco M....
AISC
2004
Springer
14 years 1 months ago
Proof Search in Minimal Logic
ion Within Partial Deduction for Linear Logic . . . . . . . . . . . . . . . . . 52 P. K¨ungas A Decision Procedure for Equality Logic with Uninterpreted Functions . . . 66 O. Tver...
Helmut Schwichtenberg
CDES
2006
106views Hardware» more  CDES 2006»
13 years 9 months ago
A Novel Essential Prime Implicant Identification Method for Exact Direct Cover Logic Minimization
- Most of the direct-cover Boolean minimization techniques use a four step cyclic algorithm. First, the algorithm chooses an On-minterm; second, it generates the set of prime impli...
Sirzat Kahramanli, Suleyman Tosun
CONCUR
2004
Springer
14 years 1 months ago
Resources, Concurrency and Local Reasoning
In this paper we show how a resource-oriented logic, separation logic, can be used to reason about the usage of resources in concurrent programs.
Peter W. O'Hearn
DDECS
2009
IEEE
202views Hardware» more  DDECS 2009»
14 years 2 months ago
Asynchronous two-level logic of reduced cost
— We propose a novel synthesis method of a dual-rail asynchronous two-level logic of reduced cost. It is based on a model that operates under so called modified weak constraints....
Igor Lemberski, Petr Fiser