Sciweavers

2519 search results - page 375 / 504
» Reasoning with Textual Cases
Sort
View
ICLP
2004
Springer
15 years 10 months ago
Termination of Logic Programs Using Various Dynamic Selection Rules
Abstract. We study termination of logic programs with dynamic scheduling, as it can be realised using delay declarations. Following previous work, our minimum assumption is that de...
Jan-Georg Smaus
136
Voted
JELIA
2004
Springer
15 years 10 months ago
Logic Programs with Functions and Default Values
In this work we reconsider the replacement of predicate-like notation by functional terms, using a similar syntax to Functional Logic Programming, but under a completely different...
Pedro Cabalar, David Lorenzo
JELIA
2004
Springer
15 years 10 months ago
Towards a Logical Analysis of Biochemical Pathways
Biochemical pathways or networks are generic representations used to model many different types of complex functional and physical interactions in biological systems. Models based ...
Patrick Doherty, Steve Kertes, Martin Magnusson, A...
KR
2004
Springer
15 years 10 months ago
On Merging Strategy-Proofness
Merging operators aim at defining the beliefs/goals of a group of agents from the beliefs/goals of each member of the group. Whenever an agent of the group has preferences over t...
Patricia Everaere, Sébastien Konieczny, Pie...
LPNMR
2004
Springer
15 years 10 months ago
Simplifying Logic Programs Under Uniform and Strong Equivalence
Abstract. We consider the simplification of logic programs under the stablemodel semantics, with respect to the notions of strong and uniform equivalence between logic programs, r...
Thomas Eiter, Michael Fink, Hans Tompits, Stefan W...