Sciweavers

2022 search results - page 222 / 405
» Complexity of Non-Monotonic Logics
Sort
View
AGP
1994
IEEE
15 years 10 months ago
What the Event Calculus actually does, and how to do it efficiently
Kowalski and Sergot's Event Calculus (EC) is a formalism for reasoning about time and change in a logic programming framework. From a description of events which occur in the...
Iliano Cervesato, Luca Chittaro, Angelo Montanari
WIA
2000
Springer
15 years 10 months ago
MONA Implementation Secrets
The Mona tool provides an implementation of the decision procedures for the logics WS1S and WS2S. It has been used for numerous applications, and it is remarkably efficient in prac...
Nils Klarlund, Anders Møller, Michael I. Sc...
DESRIST
2009
Springer
115views Education» more  DESRIST 2009»
15 years 9 months ago
Ontological design
In this paper, we describe the concept of ontological design. We show how ontologies can be used as cognitive maps of complex, ill-structured, plastic problems. They can be used t...
Arkalgud Ramaprasad, Sridhar S. Papagari
DSS
2008
130views more  DSS 2008»
15 years 6 months ago
Knowledge representation concepts for automated SLA management
Outsourcing of complex IT infrastructure to IT service providers has increased substantially during the past years. IT service providers must be able to fulfil their service-qualit...
Adrian Paschke, Martin Bichler
JELIA
2010
Springer
15 years 5 months ago
Sets of Boolean Connectives That Make Argumentation Easier
Abstract. Many proposals for logic-based formalizations of argumentation consider an argument as a pair (Φ, α), where the support Φ is understood as a minimal consistent subset ...
Nadia Creignou, Johannes Schmidt, Michael Thomas, ...