Sciweavers

121 search results - page 10 / 25
» Elimination of Negation in a Logical Framework
Sort
View
TABLEAUX
1998
Springer
13 years 11 months ago
Deleting Redundancy in Proof Reconstruction
We present a framework for eliminating redundancies during the reconstruction of sequent proofs from matrix proofs. We show that search-free proof reconstruction requires knowledge...
Stephan Schmitt, Christoph Kreitz
JAIR
2008
126views more  JAIR 2008»
13 years 7 months ago
Extended RDF as a Semantic Foundation of Rule Markup Languages
Ontologies and automated reasoning are the building blocks of the Semantic Web initiative. Derivation rules can be included in an ontology to define derived concepts based on base...
Anastasia Analyti, Grigoris Antoniou, Carlos Viega...
ENTCS
2002
157views more  ENTCS 2002»
13 years 7 months ago
Arguments and Misunderstandings: Fuzzy Unification for Negotiating Agents
In this paper, we develop the notion of fuzzy unification and incorporate it into a novel fuzzy argumentation framework for extended logic programming. We make the following contri...
Michael Schroeder, Ralf Schweimeier
AI
2006
Springer
13 years 7 months ago
Solving logic program conflict through strong and weak forgettings
We consider how to forget a set of atoms in a logic program. Intuitively, when a set of atoms is forgotten from a logic program, all atoms in the set should be eliminated from thi...
Yan Zhang, Norman Y. Foo
JSYML
2007
85views more  JSYML 2007»
13 years 7 months ago
Substructural fuzzy logics
Substructural fuzzy logics are substructural logics that are complete with respect to algebras whose lattice reduct is the real unit interval [0, 1]. In this paper, we introduce Un...
George Metcalfe, Franco Montagna