Sciweavers

2084 search results - page 89 / 417
» Set Constraints in Logic Programming
Sort
View
LPNMR
2007
Springer
14 years 2 months ago
A Preference-Based Framework for Updating Logic Programs
Abstract. We present a framework for updating logic programs under the answer-set semantics that builds on existing work on preferences in logic programming. The approach is simple...
James P. Delgrande, Torsten Schaub, Hans Tompits
AGP
2003
IEEE
14 years 1 months ago
Solving Hard Disjunctive Logic Programs Faster (Sometimes)
Disjunctive Logic Programming (DLP) under the consistent answer set semantics is an advanced formalism for knowledge representation and reasoning. It is, under widely believed assu...
Gerald Pfeifer
TCS
2008
13 years 8 months ago
Absolute versus probabilistic classification in a logical setting
Suppose we are given a set W of logical structures, or possible worlds, a set of logical formulas called possible data and a logical formula . We then consider the classification p...
Sanjay Jain, Eric Martin, Frank Stephan
SIGSOFT
2005
ACM
14 years 8 months ago
Relational analysis of algebraic datatypes
We present a technique that enables the use of finite model finding to check the satisfiability of certain formulas whose intended models are infinite. Such formulas arise when us...
Viktor Kuncak, Daniel Jackson
CL
2000
Springer
14 years 13 days ago
Promoting Constraints to First-Class Status
Abstract. This paper proposes to promote constraints to first-class status. In contrast to constraint propagation, which performs inference on values of variables, first-class co...
Tobias Müller