Sciweavers

670 search results - page 13 / 134
» Modeling generalized implicatures using non-monotonic logics
Sort
View
FMOODS
2007
13 years 8 months ago
On Formal Analysis of OO Languages Using Rewriting Logic: Designing for Performance
Rewriting logic provides a powerful, flexible mechanism for language definition and analysis. This flexibility in design can lead to problems during analysis, as different desi...
Mark Hills, Grigore Rosu
LFCS
2009
Springer
14 years 1 months ago
Fuzzy Description Logic Reasoning Using a Fixpoint Algorithm
We present FixIt(ALC), a novel procedure for deciding knowledge base (KB) satisfiability in the Fuzzy Description Logic (FDL) ALC. FixIt(ALC) does not search for tree-structured m...
Uwe Keller, Stijn Heymans
ENTCS
2008
64views more  ENTCS 2008»
13 years 7 months ago
General Refinement, Part Two: Flexible Refinement
In the previous, companion, paper [13] to this paper we introduced our general model of refinement, discussed ideas around determinism and interfaces that the general definition r...
Steve Reeves, David Streader
ML
2008
ACM
150views Machine Learning» more  ML 2008»
13 years 7 months ago
Learning probabilistic logic models from probabilistic examples
Abstract. We revisit an application developed originally using Inductive Logic Programming (ILP) by replacing the underlying Logic Program (LP) description with Stochastic Logic Pr...
Jianzhong Chen, Stephen Muggleton, José Car...
IANDC
2008
114views more  IANDC 2008»
13 years 7 months ago
Generalizing the Paige-Tarjan algorithm by abstract interpretation
act Interpretation Francesco Ranzato and Francesco Tapparo Dipartimento di Matematica Pura ed Applicata, Universit`a di Padova, Italy The Paige and Tarjan algorithm (PT) for comp...
Francesco Ranzato, Francesco Tapparo