Sciweavers

2920 search results - page 82 / 584
» Finite information logic
Sort
View
CADE
2012
Springer
12 years 12 days ago
SPARQL Query Containment under RDFS Entailment Regime
The problem of SPARQL query containment is defined as determining if the result of one query is included in the result of another for any RDF graph. Query containment is important...
Melisachew Wudage Chekol, Jérôme Euze...
EUROPLOP
2006
13 years 11 months ago
Business Logic in the Presentation Layer - Design Patterns on the Implementation of Business Logic on the Client-Side
Abstract: As a general rule of thumb, business logic in a multi-layered information system should be implemented in a dedicated domain layer and be separated from the presentation ...
Tim Wellhausen
TCOM
2008
84views more  TCOM 2008»
13 years 10 months ago
On the Performance of Closed-Loop Transmit Diversity with Noisy Channel Estimates and Finite-Depth Interleaved Convolutional Cod
Abstract-- In this paper, closed-form expressions for the uncoded bit error probability of closed-loop transmit diversity (CLTD) algorithms with two transmit and one receive antenn...
Jittra Jootar, James R. Zeidler, John G. Proakis
IAT
2008
IEEE
14 years 4 months ago
Extending a Defeasible Reasoner with Modal and Deontic Logic Operators
Defeasible logic is a non-monotonic formalism that deals with incomplete and conflicting information. Modal logic deals with necessity and possibility, exhibiting defeasibility; t...
Efstratios Kontopoulos, Nick Bassiliades, Guido Go...
IJAR
2008
129views more  IJAR 2008»
13 years 10 months ago
Formalizing argumentative reasoning in a possibilistic logic programming setting with fuzzy unification
Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating the trea...
Teresa Alsinet, Carlos Iván Chesñeva...