Sciweavers

2022 search results - page 127 / 405
» Complexity of Non-Monotonic Logics
Sort
View
TABLEAUX
2005
Springer
15 years 6 months ago
Description Logics in Ontology Applications
Abstract. Description Logics (DLs) are a family of logic based knowledge representation formalisms. Although they have a range of applications (e.g., configuration and information...
Ian Horrocks
EUROPAR
2004
Springer
15 years 6 months ago
Concurrent Table Accesses in Parallel Tabled Logic Programs
Tabling is an implementation technique that improves the declarativeness and expressiveness of Prolog by reusing answers to subgoals. The declarative nature of tabled logic program...
Ricardo Rocha, Fernando M. A. Silva, Vítor ...
100
Voted
DEXAW
1998
IEEE
94views Database» more  DEXAW 1998»
15 years 5 months ago
Towards Access Control for Logical Document Structures
This paper presents a first step towards a security model that defines access control for logical document structures. el benefits from roles to abstract from users and from secur...
Fredj Dridi, Gustaf Neumann
130
Voted
DALT
2009
Springer
15 years 4 months ago
Computing Utility from Weighted Description Logic Preference Formulas
We propose a framework to compute the utility of a proposal w.r.t. a preference set in a negotiation process. In particular, we refer to preferences expressed as weighted formulas ...
Azzurra Ragone, Tommaso Di Noia, Francesco M. Doni...
UAI
2008
15 years 2 months ago
Improving the Accuracy and Efficiency of MAP Inference for Markov Logic
In this work we present Cutting Plane Inference (CPI), a Maximum A Posteriori (MAP) inference method for Statistical Relational Learning. Framed in terms of Markov Logic and inspi...
Sebastian Riedel