Sciweavers

1144 search results - page 24 / 229
» Logic programming for combinatorial problems
Sort
View
AGP
2003
IEEE
14 years 28 days ago
Transforming co-NP Checks to Answer Set Computation by Meta-Interpretation
Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and check” nature ...
Thomas Eiter, Axel Polleres
JUCS
2006
126views more  JUCS 2006»
13 years 7 months ago
Behavioral Institutions and Refinements in Generalized Hidden Logics
: We investigate behavioral institutions and refinements in the context of the object oriented paradigm. The novelty of our approach is the application of generalized abstract alge...
Manuel A. Martins
ICLP
2001
Springer
14 years 3 days ago
A Multi-adjoint Logic Approach to Abductive Reasoning
Multi-adjoint logic programs has been recently introduced [9, 10] as a generalization of monotonic logic programs [2, 3], in that simultaneous use of several implications in the ru...
Jesús Medina, Manuel Ojeda-Aciego, Peter Vo...
ICALP
2010
Springer
13 years 9 months ago
B and D Are Enough to Make the Halpern-Shoham Logic Undecidable
Abstract. The HalpernShoham logic is a modal logic of time intervals. Some eort has been put in last ten years to classify fragments of this beautiful logic with respect to decid...
Jerzy Marcinkowski, Jakub Michaliszyn, Emanuel Kie...
AO
2007
80views more  AO 2007»
13 years 7 months ago
Problems in the ontology of computer programs
As a first step in the larger project of charting the ontology of computer programs, we pose three central questions: (1) Can programs, hardware, and metaprograms be organized into...
Amnon H. Eden, Raymond Turner