Sciweavers

4513 search results - page 653 / 903
» Logic programming with satisfiability
Sort
View
JODS
2008
123views Data Mining» more  JODS 2008»
15 years 4 months ago
A Fine-Grained Approach to Resolving Unsatisfiable Ontologies
The ability to deal with inconsistencies and to evaluate the impact of possible solutions for resolving inconsistencies are of the utmost importance in real world ontology applicat...
Joey Sik Chun Lam, Derek H. Sleeman, Jeff Z. Pan, ...
LOGCOM
2008
106views more  LOGCOM 2008»
15 years 4 months ago
Reinforcement Belief Revision
The capability of revising its beliefs upon new information in a rational and efficient way is crucial for an intelligent agent. The classical work in belief revision focuses on i...
Yi Jin, Michael Thielscher
ENTCS
2007
103views more  ENTCS 2007»
15 years 3 months ago
Policy-based Coordination in PAGODA: A Case Study
PAGODA (Policy And GOal Based Distributed Autonomy) is a modular architecture for specifying and prototyping autonomous systems. A PAGODA node (agent) interacts with its environme...
Carolyn L. Talcott
TCAD
2002
115views more  TCAD 2002»
15 years 3 months ago
Analytical models for crosstalk excitation and propagation in VLSI circuits
We develop a general methodology to analyze crosstalk effects that are likely to cause errors in deep submicron high speed circuits. We focus on crosstalk due to capacitive coupli...
Wei-Yu Chen, Sandeep K. Gupta, Melvin A. Breuer
NETWORKS
2007
15 years 3 months ago
Vertex disjoint routings of cycles over tori
We study the problem of designing a survivable WDM network based on covering the communication requests with subnetworks that are protected independently from each other. We consi...
Jean-Claude Bermond, Min-Li Yu