Sciweavers

1144 search results - page 57 / 229
» Logic programming for combinatorial problems
Sort
View
IJCAI
2003
13 years 9 months ago
Minimal Change and Maximal Coherence for Epistemic Logic Program Updates
We consider the problem of updating nonmonotonic knowledge bases represented by epistemic logic programs where disjunctive information and notions of knowledge and beliefs can be ...
Yan Zhang
IJCAI
1989
13 years 9 months ago
Logic Programming with General Clauses and Defaults Based on Model Elimination
The foundations of a class of logic programming systems with the expressive power of full first-order logic and a non-monotonic component is addressed. The underlying refutation m...
Marco A. Casanova, Ramiro A. de T. Guerreiro, Andr...
ICLP
2007
Springer
14 years 1 months ago
Minimal Logic Programs
aa We consider the problem of obtaining a minimal logic program strongly equivalent (under the stable models semantics) to a given arbitrary propositional theory. We propose a meth...
Pedro Cabalar, David Pearce, Agustín Valver...
ATAL
2010
Springer
13 years 8 months ago
Finding approximate competitive equilibria: efficient and fair course allocation
In the course allocation problem, a university administrator seeks to efficiently and fairly allocate schedules of over-demanded courses to students with heterogeneous preferences...
Abraham Othman, Tuomas Sandholm, Eric Budish
WLP
1997
Springer
13 years 12 months ago
Extending Homeomorphic Embedding in the Context of Logic Programming
Recently well-quasi orders in general, and homeomorphic embedding in particular, have gained popularity to ensure the termination of program analysis, specialisation and transform...
Michael Leuschel