Sciweavers

85 search results - page 3 / 17
» Reimagining literate programming
Sort
View
FUIN
2006
145views more  FUIN 2006»
13 years 6 months ago
Negative Ordered Hyper-Resolution as a Proof Procedure for Disjunctive Logic Programming
We prove that negative hyper-resolution using any liftable and well-founded ordering refinement is a sound and complete procedure for answering queries in disjunctive logic program...
Linh Anh Nguyen
IPL
2008
111views more  IPL 2008»
13 years 6 months ago
Adding cardinality constraints to integer programs with applications to maximum satisfiability
Max-SAT-CC is the following optimization problem: Given a formula in CNF and a bound k, find an assignment with at most k variables being set to true that maximizes the number of ...
Markus Bläser, Thomas Heynen, Bodo Manthey
ILP
2003
Springer
13 years 11 months ago
Query Optimization in Inductive Logic Programming by Reordering Literals
Query optimization is used frequently in relational database management systems. Most existing techniques are based on reordering the relational operators, where the most selective...
Jan Struyf, Hendrik Blockeel
APSEC
2002
IEEE
13 years 11 months ago
Theme-Based Literate Programming
Andreas Kacofegitis, Neville Churcher
EUSFLAT
2009
126views Fuzzy Logic» more  EUSFLAT 2009»
13 years 4 months ago
Fuzzy Answer Set Programming with Literal Preferences
Jeroen Janssen, Steven Schockaert, Dirk Vermeir, M...