Sciweavers

4679 search results - page 182 / 936
» Modeling When Connections Are the Problem
Sort
View
ENTCS
2006
103views more  ENTCS 2006»
15 years 1 months ago
Supporting SAT based BMC on Finite Path Models
The standard translation of a Bounded Model Checking (BMC) instance into a satisfiability problem, (a.k.a SAT), might produce misleading results in the case when the model under v...
Daniel Geist, Mark Ginzburg, Yoad Lustig, Ishai Ra...
LICS
2005
IEEE
15 years 7 months ago
Model-Checking Hierarchical Structures
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
Markus Lohrey
COLING
1996
15 years 3 months ago
Prepositional Phrase Attachment Through A Hybrid Disambiguation Model
Prepositional phrase attachment is a major cause of stru(:tural alnbiguity in natural language. Recent work has been dependent on corpus-based approaches to deal with this problem...
Haodong Wu, Teiji Furugori
CORR
2010
Springer
168views Education» more  CORR 2010»
15 years 5 days ago
Gaussian Process Structural Equation Models with Latent Variables
In a variety of disciplines such as social sciences, psychology, medicine and economics, the recorded data are considered to be noisy measurements of latent variables connected by...
Ricardo Silva
CORR
2004
Springer
124views Education» more  CORR 2004»
15 years 1 months ago
On the existence of stable models of non-stratified logic programs
In this paper we analyze the relationship between cyclic definitions and consistency in GelfondLifschitz's answer sets semantics (initially defined as `stable model semantics...
Stefania Costantini