Sciweavers

1087 search results - page 93 / 218
» Exploiting Description Logic Reasoners in Inductive Logic
Sort
View
LPKR
1997
Springer
15 years 2 months ago
Reasoning with Prioritized Defaults
The purpose of this paper is to investigate the methodology of reasoning with prioritized defaults in the language of logic programs under the answer set semantics. We present a do...
Michael Gelfond, Tran Cao Son
IGPL
2008
103views more  IGPL 2008»
14 years 10 months ago
Transition Logic Revisited
A new version of transition logic is presented. It integrates (dynamic) transitions, which change world states, and classical (static) reasoning, restricted in the paper to Horn l...
Wolfgang Bibel
CADE
2008
Springer
15 years 10 months ago
Automated Induction with Constrained Tree Automata
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are int...
Adel Bouhoula, Florent Jacquemard
IEAAIE
2005
Springer
15 years 3 months ago
Ontology-Based Natural Language Parser for E-Marketplaces
We propose an approach to Natural Language Processing exploiting knowledge domain in an e-commerce scenario. Based on such modeling an NLP parser is presented, aimed at translating...
Stefano Coppi, Tommaso Di Noia, Eugenio Di Sciasci...
CADE
1999
Springer
15 years 2 months ago
System Description: CutRes 0.1: Cut Elimination by Resolution
CutRes is a system which takes as input an LK-proof with arbitrary cuts and skolemized end-sequent and gives as output an LKproof with atomic cuts only. The elimination of cuts is ...
Matthias Baaz, Alexander Leitsch, Georg Moser