Disjunctive Answer Set Solvers Remi Brochenin1 and Yuliya Lierler2 and Marco Maratea3 Abstract. A fundamental task in answer set programming is to compute answer sets of logic programs. Answer set solvers are the programs that perform this task. The problem of deciding whether a disjunctive program has an answer set is Σ2 -complete. The high complexity of reasoning within disjunctive logic prog...

Many autobiographical and fictional accounts of “schizophrenia” have appeared in the popular literature in recent years. Several have become best-sellers and were read by thousands of people around the world. Among the better known are Hannah Green’s I JVever Promised You a Rose Garden 1 and The Eden Express by Mark Vonnegut.2 Green’s book was even turned into a movie. However, the people descr...

recalled that one had shown three bands, produced ples of versatility in response to DNA alterations are the frequent collapse of DNA replication forks encountering by a mix-up in the experimental procedure. No such endogenous damage in normal proliferating cells, which photograph was among the preserved set. To avoid necessitates resolution by specific recombinational re-forcing the interpreta...

Aaskov, John Abdeladhim, Maha Abeles, Shira Abrahao, Jonatas Aceituno, Anna Achee, Nichole Adamson, Martin. A Adhikarla, Haritha Agampodi, Suneth Agudelo-Flórez, Piedad Aguilar, Patricia Ahmed, Ahmed Aidoo, Michael Aiello, Allison Ajjampur, Sitara Akanda, Ali Al-Mekhlafi, Hesham Alborzi, Abdolvahab Albrecht, Randy Alcid, David Aldridge, Jerry Aldstadt, Jared Alegana, Victor Alevi, Kaio Cesar Al...

332 JAMC • 4 FÉVR. 2003; 168 (3) The CMA has appointed a Journal Oversight Committee (JOC) to review journal content and “assist in maintaining harmonious relations between CMAJ and the association” (see Commentary, p. 287). Although the committee didn’t hold its initial meeting until December, a month after a well-publicized contretemps that followed publication of a controversial editorial (Q...

summary by Olivier Dubois and Remi Monasson] The satisfaction of constrained formulae is a key issue in complexity theory. Many computational problems are shown to be NP-complete through a polynomial mapping onto the K-Satissability (SAT) problem. Recently, there has been much interest in a random version of the K-SAT problem deened as follows. Consider N Boolean variables x i , i = 1; : : :; N...

1 Acting Director, Prosthetic and Sensory Aids Service, U.S. Veterans Administration, Washington 25, D.C. THE limbs of m a n move in space and t ime, in response to systems of internal and external forces, and in accordance wi th the laws of mechanics. To restore to any satisfactory extent the functions lost through amputa t ion of an ext remi ty therefore requires in t imate knowledge not only...