Sciweavers

4401 search results - page 347 / 881
» Computing with Default Logic
Sort
View
ICML
2010
IEEE
15 years 7 months ago
Learning Markov Logic Networks Using Structural Motifs
Markov logic networks (MLNs) use firstorder formulas to define features of Markov networks. Current MLN structure learners can only learn short clauses (4-5 literals) due to extre...
Stanley Kok, Pedro Domingos
CORR
2002
Springer
132views Education» more  CORR 2002»
15 years 6 months ago
Nonmonotonic Reasoning, Preferential Models and Cumulative Logics
Many systems that exhibit nonmonotonic behavior have been described and studied already in the literature. The general notion of nonmonotonic reasoning, though, has almost always ...
Sarit Kraus, Daniel J. Lehmann, Menachem Magidor
ENTCS
2007
190views more  ENTCS 2007»
15 years 6 months ago
Modelling Multicast QoS Routing by using Best-Tree Search in And-or Graphs and Soft Constraint Logic Programming
We suggest a formal model to represent and solve the multicast routing problem in multicast networks. To attain this, we model the network adapting it to a weighted and-or graph, ...
Stefano Bistarelli, Ugo Montanari, Francesca Rossi...
LICS
2010
IEEE
15 years 4 months ago
Recursion Schemes and Logical Reflection
Let R be a class of generators of node-labelled infinite trees, and L be a logical language for describing correctness properties of these trees. Given R R and L, we say that R ...
Christopher H. Broadbent, Arnaud Carayol, C.-H. Lu...
TAP
2010
Springer
134views Hardware» more  TAP 2010»
15 years 4 months ago
Testing First-Order Logic Axioms in Program Verification
Program verification systems based on automated theorem provers rely on user-provided axioms in order to verify domain-specific properties of code. However, formulating axioms corr...
Ki Yung Ahn, Ewen Denney