Sciweavers

1055 search results - page 81 / 211
» On the Semantics of Logic Programs with Preferences
Sort
View
KR
2004
Springer
15 years 10 months ago
On Eliminating Disjunctions in Stable Logic Programming
Disjunction is generally considered to add expressive power to logic programs under the stable model semantics, which have become a popular programming paradigm for knowledge repr...
Thomas Eiter, Michael Fink, Hans Tompits, Stefan W...
FUIN
2010
130views more  FUIN 2010»
15 years 3 months ago
SLGAD Resolution for Inference on Logic Programs with Annotated Disjunctions
Abstract. Logic Programs with Annotated Disjunctions (LPADs) allow to express probabilistic information in logic programming. The semantics of an LPAD is given in terms of the well...
Fabrizio Riguzzi
144
Voted
DALT
2007
Springer
15 years 8 months ago
Extending Propositional Logic with Concrete Domains for Multi-issue Bilateral Negotiation
We present a novel approach to knowledge-based automated one-shot multi-issue bilateral negotiation handling, in a homogeneous setting, both numerical features and non-numerical on...
Azzurra Ragone, Tommaso Di Noia, Eugenio Di Sciasc...
158
Voted
SEMWEB
2010
Springer
15 years 2 months ago
Towards Semantic Annotation Supported by Dependency Linguistics and ILP
In this paper we present a method for semantic annotation of texts, which is based on a deep linguistic analysis (DLA) and Inductive Logic Programming (ILP). The combination of DLA...
Jan Dedek
127
Voted
ICLP
1992
Springer
15 years 8 months ago
Records for Logic Programming
CFT is a new constraint system providing records as logical data structure for constraint (logic) programming. It can be seen as a generalization of the rational tree system emplo...
Gert Smolka, Ralf Treinen