Sciweavers

342 search results - page 33 / 69
» Tableau Algorithms for Description Logics
Sort
View
EKAW
2004
Springer
14 years 2 months ago
Extending Semantic-Based Matchmaking via Concept Abduction and Contraction
Motivated by the need to extend features of semantic matchmaking between request and offer descriptions, a model is presented that exploits recently proposed non-standard inference...
Tommaso Di Noia, Eugenio Di Sciascio, Francesco M....
JLP
2000
134views more  JLP 2000»
13 years 8 months ago
Abducing through negation as failure: stable models within the independent choice logic
The independent choice logic (ICL) is part of a project to combine logic and decision/game theory into a coherent framework. The ICL has a simple possible-worlds semantics charact...
David Poole
CIC
2004
101views Communications» more  CIC 2004»
13 years 10 months ago
Lexicons in TIL and Verb Valency Frames
Abstract--The types of lexicons necessary for Transparent Intensional Logic (TIL) logical analysis will be described. We will show the algorithm for analysing the TIL verbal object...
Ales Horák, Karel Pala
GECCO
2004
Springer
134views Optimization» more  GECCO 2004»
14 years 2 months ago
A New Universal Cellular Automaton Discovered by Evolutionary Algorithms
In Twenty Problems in the Theory of Cellular Automata, Stephen Wolfram asks “how common computational universality and undecidability [are] in cellular automata.” This papers p...
Emmanuel Sapin, Olivier Bailleux, Jean-Jacques Cha...
BIRTHDAY
2004
Springer
14 years 2 months ago
Pure Type Systems in Rewriting Logic: Specifying Typed Higher-Order Languages in a First-Order Logical Framework
Abstract. The logical and operational aspects of rewriting logic as a logical framework are tested and illustrated in detail by representing pure type systems as object logics. Mor...
Mark-Oliver Stehr, José Meseguer