Sciweavers

3032 search results - page 272 / 607
» Description Logic Rules
Sort
View
CORR
2010
Springer
194views Education» more  CORR 2010»
15 years 2 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...
CLEF
2005
Springer
15 years 10 months ago
The University of Alicante at CL-SR Track
This paper describes the participation of the University of Alicante in the new CL-SR Track at CLEF conference. In this track we introduce a set of features in the topics processi...
Rafael M. Terol, Manuel Palomar, Patricio Mart&iac...
LPNMR
2005
Springer
15 years 10 months ago
Approximating Answer Sets of Unitary Lifschitz-Woo Programs
We investigate techniques for approximating answer sets of general logic programs of Lifschitz and Woo, whose rules have single literals as heads. We propose three different method...
Victor W. Marek, Inna Pivkina, Miroslaw Truszczyns...
CAISE
2006
Springer
15 years 8 months ago
Modelling and Verifying of e-Commerce Systems
Static function hierarchies and models of the dynamic behaviour are typically used in e-commerce systems. Issues to be verifies are the completeness and correctness of the static f...
Andreas Speck
IGPL
1998
64views more  IGPL 1998»
15 years 4 months ago
Formulas for which Contraction is Admissible
A formula A is said to have the contractionproperty in a logic L i whenever A;A;? `L B (when ? is a multiset) also A;? `L B. In MLL and in MALL without the additive constants a fo...
Arnon Avron