Sciweavers

2766 search results - page 146 / 554
» Hybridizing a Logical Framework
Sort
View
SUM
2009
Springer
15 years 8 months ago
Weighted Description Logics Preference Formulas for Multiattribute Negotiation
We propose a framework to compute the utility of an agreement w.r.t. a preference set in a negotiation process. In particular, we refer to preferences expressed as weighted formula...
Azzurra Ragone, Tommaso Di Noia, Francesco M. Doni...
AAAI
2006
15 years 5 months ago
Forgetting and Conflict Resolving in Disjunctive Logic Programming
We establish a declarative theory of forgetting for disjunctive logic programs. The suitability of this theory is justified by a number of desirable properties. In particular, one...
Thomas Eiter, Kewen Wang
AI
2006
Springer
15 years 4 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
ESWS
2007
Springer
15 years 10 months ago
A Reasoning Framework for Rule-Based WSML
WSML is an ontology language specifically tailored to annotate Web Services, and part of its semantics adheres to the rule-based knowledge representation paradigm of logic program...
Stephan Grimm, Uwe Keller, Holger Lausen, Gá...
CORR
2010
Springer
194views Education» more  CORR 2010»
15 years 1 months ago
A Focused Sequent Calculus Framework for Proof Search in Pure Type Systems
Basic proof search tactics in logic and type theory can be seen as the root-rst applications of rules in an appropriate sequent calculus, preferably without the redundancies gener...
Stéphane Lengrand, Roy Dyckhoff, James McKi...