Sciweavers

143 search results - page 5 / 29
» Fixed-Parameter Complexity of Semantics for Logic Programs
Sort
View
ECAI
1998
Springer
15 years 1 months ago
Probabilistic Logic Programming
We present probabilistic logic programming under inheritance with overriding. This approach is based on new notions of entailment for reasoning with conditional constraints, which...
Thomas Lukasiewicz
ICDE
1993
IEEE
103views Database» more  ICDE 1993»
15 years 1 months ago
IsaLog: A declarative language for complex objects with hierarchies
The IsaLog model and language are presented. The model has complex objects with classes, relations, and isa hierarchies. The language is strongly typed and declarative. The main i...
Paolo Atzeni, Luca Cabibbo, Giansalvatore Mecca
NMR
2004
Springer
15 years 2 months ago
On acyclic and head-cycle free nested logic programs
We define the class of head-cycle free nested logic programs, and its proper subclass of acyclic nested programs, generalising similar classes originally defined for disjunctive...
Thomas Linke, Hans Tompits, Stefan Woltran
LPNMR
2009
Springer
15 years 4 months ago
Complexity of the Stable Model Semantics for Queries on Incomplete Databases
Abstract. We study the complexity of consistency checking and query answering on incomplete databases for languages ranging from non-recursive Datalog to disjunctive Datalog with n...
Jos de Bruijn, Stijn Heymans
ESWS
2007
Springer
15 years 3 months ago
Vague Knowledge Bases for Matchmaking in P2P E-Marketplaces
In this paper we propose an approach to semantic matchmaking that exploits various knowledge representation technologies to find most promising partners in peer-to-peer e-marketpl...
Azzurra Ragone, Umberto Straccia, Tommaso Di Noia,...