MINUTES OF READING THIS WILL CHANGE YOUR LIFE"
easy to read, understandable Instructions.
Eye open waking hypnosis with waking hypnosis demonstrations. Arm catalepsy, name and number amnesia, happy finger, mouth lock and hand stuck to the forehead.
learn Hypnosis and get rich benefits from it.
This video course provides you all that you need to become a MASTER HYPNOTIST. It also teaches you simple and easy techniques to put a person into deep Hypnotic trance.
This video course provides you the tools and techniques to hypnotize someone. You can lay a deep and powerful impact on others and impress others. You will be admired and respected as you will become a MASTER HYPNOTIST.
hand stuck to the head, eye lock, legs stuck to the floor.
As you begin hypnotizing and develop your knowledge and understanding of Hypnosis, your levels of personal pride and self esteem will soar. A successful Hypnotist will usually be a proud person with great confidence, a strong ego and a high sense of self worth. Want to be a Hypnotist and Hypnotize others - and are prepared to put in the effort - then you probably can be!
This video course teaches you Rapid and Instant Induction techniques that helps you to induce trance in less than 3 seconds. Then you will be able to teach people Self-Hypnosis and do Hypnotic Anesthesia. All these can be done in less than 5 minutes. Definitely you need to practice these techniques to really master it. Then you will be able to do it anytime, anywhere, easily and effortlessly.
I will dispel all the myths and tell you all the facts.
Fool Proof Instructions... to Hypnotize your friends, family, co-workers – even yourself.
You will learn exactly what to say with proven step by step scripts.
Unmistakable ways... to tell if someone is hypnotized.
The 8 essential concepts for hypnotizing people in a matter of seconds with rapid inductions.
up to twenty people in minutes.
HYPNOSIS IS VERY real...it is easy and everyone can do it.
What you can accomplish with it?
Who can you safely hypnotize?
You are intelligent and curious about hypnosis.
Use hypnosis to help yourself and others.
Add Hypnosis to your professional toolkit.
You are considering studying Hypnotherapy as a career.
Learning the fundamental basics of hypnosis right from home.
What this 8 hours 4 DVD's Video Course includes?
Each technique has an introduction, which explains how and why the technique is used.
The instant induction - inducing trance in less than 3 seconds.
The Rapid Induction - a fun and gentle way to induce trance in 3-4 seconds.
The progressive Relaxation - complete mind and body relaxation.
Eight Best effective trance-deepening techniques.
How to do an efficient and effective Pre-Talk.
The Pre-talk will teach you what Hypnosis is, how Hypnosis works and how to gain rapport with your client, so that everyone is hypnotizable.
Each induction, deepening technique and pre-talk come with its very own script for you to read and follow and make hypnosis easy.
Everything you need to know to perform effective hypnosis equal to certified Hypnotists.
The latest techniques and approaches in advanced Hypnosis/Hypnotherapy.
Dave Elman Powerful Induction Technique - It is one of the Most Powerful technique in hypnosis. It takes just 3 minutes to put a person into deep hypnotic stage and works 95% of the time.
Controlling Pain - Self and others.
Non verbal induction (without using a word).
Yes/No Finger Signals to communicate with your subconcious mind and healing.
Pendulam Yes/No Signals to communicate with your subconcious mind and healing.
have requested and feel great about helping them.
Hypnosis is currently riding a wave of popularity among the public.
the process, and obtain relief from your own problems.
fear of public speaking for ever.
crowd start speaking, impart knowledge, evoke laughter and get applauded.
Mr.Pradeep Aggarwal has taught me new things. I can now think of going into trance and program myself for day to day challenges.
goal setting and many more things that I need in my life.
shorter period of time. I will always use the goal setting program taught by Mr. Pradeep Aggarwal.
and spread the awareness about hypnosis in our country.
I am empowered with the techniques of hypnosis. They can be practised effortlessely, naturally and automatically. I've learnt self-hypnosis, NLP techniques, relaxation, concentration and the most important I have learnt how to make use of the extra power of the subconscious mind which we do not use before.
physical and mental disabilities and blocks.
Its Wonderful amazing, thankyou very much sir already changes working for me, every thing can be done easily and effectively, its unbelievable, thank you once again.
in our life. The thinking programming my mind in to the immediate outsourcing of solving my problems it will help me to clear off all my debts at the earliest.
An effective program to improve quality life set goals, removal of mental blocks.
It is very useful to every person especially a person is feeling social responsibility.
TO PUT ANYONE IN A TRANCE... INSTANTLY!
ORDER NOW FOR ONLY $ 111.00 PAY THROUGH CREDIT CARD!
More than 70 positive Affirmations to change and improve your life. Some of the Power Affirmations on topics include: Alcohol, Depression, Drug Addictions, Energy, Exam Anxiety, Secret of Study Habits, Goal Accomplishment, Pain Control, Insomnia, Procrastination, Stop Smoking, Weight Loss & Self Confidence.
If we have encountered failures in a particular venture in the past, we might begin to believe that we could never again succeed in that particular venture. This belief can shackle us from even trying out that venture in the future. Thus, the key to a more satisfying life is to over come these negative beliefs. This POWERFUL book provides some remarkably simple tools to reshape your life. The STEP BY STEP process include chapters for each week you need to follow and implement includes – Self Hypnosis, Emotions, Health & Healing, Money, Relationship, Spirituality, and Recap.
You can get everything you want. You will simply be unstoppable in making your dreams come true. And you can literally change your destiny. This is possible through a power that everyone has – THE POWER OF THE MIND. By learning some simple, well-defined techniques you can actually rule over your mind. You can make your mind work for you. The Amazing chapters in this book include – Mind over Matter, Creating Visuals, Step to acquire Mind Power, How to be Successful Man, How to be a Winner, How to Remove your Fear, How to Improve your Personality, How to Lean a Healthy Life, How to Lead a Peaceful Life, How to Control Your Anger, How to Win Love, How to Improve your Sexual Life, How to Stay Young for Forever.
Stage Hypnosis is all about Fun, Frolic and Entertainment. The books gives you step by step instructions on How to Perform Hypnotic Acts on Stage. The easy to learn steps include Introductory remarks, How to select subjects, How to build confidence and rapport with the audience. The books also includes some amazing tests you can perform on stage.
This book consists of Deepening Techniques, Induction Techniques, Testing Techniques and Trance Techniques for both children and elder people. All the techniques are explained in easy to understand step by procedure to easily and effectively to put anybody in a hypnotic state.
This recorded audio script is a process to find the cause of your problem, Heal & Release on your subconscious level. Proper suggestions are also given to develop confidence.
Think about one problem in the mind at one time to solve it.
Learn NOW, and be a Professional Hypnotist.


text:
Free Lecture: Renewable Energy for the Developing World
What is renewable energy? What is the developing world? How do these concepts relate? Expert instructor Ian Woofenden explains…
Renewable energy (RE) technologies have broad application in the "developing world", or rural countries and areas that have less technology and infrastructure. In fact, bringing RE to poorer and more remote places can leap-frog technology that we have come to assume as "normal" in our modern lives, avoiding cost and environmental damage.
Ian Woofenden has been consulting, teaching, and leading projects in Central America and the Caribbean for more than a decade, and shares his first-hand experience with seven RE technologies. Using photographs of real-world projects, stories, and lessons, Ian brings realism to our desire to help others, with insight into what works and what doesn't. Ian's Costa Rica workshops are featured in this 45-minute lecture that may inspire and entertain you.
Enroll in Renewable Energy for the Developing World today.
Ian answers questions such as "What is Renewable Energy?" and "What is the Developing World?" with expert insight. He discusses the RE technologies available today- from Wind, Solar and Hydro Electricity, to Methane, Human Power, Solar Cooking and Solar Hot Water.
Enroll in Ian's 6-week Small Wind 101 course and learn how to evaluate your site, while gaining critical theory and practical guidelines so you can avoid common pitfalls and capture wind energy successfully.
About Instructor Ian Woofenden
Ian Woofenden has been using wind electricity for more than 30 years. He is the author of Wind Power for Dummies and many articles on wind power in Home Power Magazine, where he works as a Senior Editor. He has been a writer, teacher, consultant, and tower jockey in the wind industry and loves to share his knowledge and experience, with an off-grid end-user's perspective. Past students find him to be personable and accessible as he shares his passion while answering student questions.
Learn more about Ian, HeatSpring's Sustainable Scholar, expert instructor, senior Editor for Home Power Magazine, and "Wind Power for Dummies" author here.
2016-09-01T22:03:34+00:00March 18th, 2016|Categories: Solar Design & Installation, Wind|Tags: Developing World, Free HeatSpring Lecture, Free Lecture, HeatSpring Wind, Human Power, Hydro Electricity, Hydro Power, ian woofenden, Methane, renewable energy, Renewable Energy in the Developing World, Small Wind 101, Small Wind 101 HeatSpring, Solar Cooking, Solar Electricity, solar hot water, solar power, Technology for Developing World, Wind, wind electricity, Wind Power|

redpajama_set_name: RedPajamaCommonCrawl


text:
Q: NestJs error: can't resolve dependencies of the Service (?). Please make sure that the argument SchemaModel at index [0] is available I get this error:
Nest can't resolve dependencies of the UserPreferencesService (?). Please make sure that the argument UserPreferencesSchemaModel at index [0] is available in the UserPreferencesModule context.

What can the error be? I understand that the problem happens in the user-preferences.service.ts file. as when I comment the following lines from the user-preferences.module.ts file all works fine.
  controllers: [UserPreferencesController],
  providers: [UserPreferencesService],

This is my user-preferences.service.ts file:
import { Injectable } from '@nestjs/common';
import { Model } from 'mongoose';
import { InjectModel } from '@nestjs/mongoose';
import { UserPreferencesInterface } from './interfaces/user-preferences.interface';

@Injectable()
export class UserPreferencesService {
  constructor(
    @InjectModel('UserPreferencesSchema')
    private readonly UserPreferencesModel: Model<UserPreferencesInterface>,
  ) {}

  public async postUserPreferences(newUserPreferences: any): Promise<any> {
    const userPreferences = await new this.UserPreferencesModel(
      newUserPreferences,
    );
    return userPreferences.save();
  }
}

app.module.ts
    import { Module } from '@nestjs/common';
    import { UserPreferencesModule } from './user-preferences/user-preferences.module';
    import { MongooseModule } from '@nestjs/mongoose';

    @Module({
      imports: [
        UserPreferencesModule,
        MongooseModule.forRoot(
          'mongodb+srv://user:pass@db.hucjifz.mongodb.net/dbname?retryWrites=true&w=majority',
        ),
      ],
    })
    export class AppModule {}

user-preferences.module.ts
import { Module } from '@nestjs/common';
import { MongooseModule } from '@nestjs/mongoose';
import { UserPreferencesSchema } from './schemas/user-preferences.schema';
import { UserPreferencesController } from './user-preferences.controller';
import { UserPreferencesService } from './user-preferences.service';

@Module({
  imports: [
    MongooseModule.forFeature([
      {
        name: 'UserPreferences',
        schema: UserPreferencesSchema,
      },
    ]),
  ],
  controllers: [UserPreferencesController],
  providers: [UserPreferencesService],
})
export class UserPreferencesModule {}

user-preferences.controller.ts
import {Body, Controller, Get, Post, Put } from '@nestjs/common';
import { UserPreferencesService } from './user-preferences.service';
import { UserPreferencesDto }  from './dto/user-preferences.dto'
@Controller('user-preferences')
export class UserPreferencesController {

    constructor(private userPreferencesService: UserPreferencesService) {}

    @Get()
    public getUserPreferences() {
        return this.userPreferencesService.getUserPreferences();
    }

    @Post ()
    public postUserPreferences(
        @Body() userPreferences: UserPreferencesDto
    ) {
        return this.userPreferencesService.postUserPreferences( userPreferences );
    }

}

this is the complete error:
[Nest] 65481  - 06/07/2022, 6:00:04 AM   ERROR [ExceptionHandler] Nest can't resolve dependencies of the UserPreferencesService (?). Please make sure that the argument UserPreferencesSchemaModel at index [0] is available in the UserPreferencesModule context.

Potential solutions:
- If UserPreferencesSchemaModel is a provider, is it part of the current UserPreferencesModule?
- If UserPreferencesSchemaModel is exported from a separate @Module, is that module imported within UserPreferencesModule?
  @Module({
    imports: [ /* the Module containing UserPreferencesSchemaModel */ ]
  })

Error: Nest can't resolve dependencies of the UserPreferencesService (?). Please make sure that the argument UserPreferencesSchemaModel at index [0] is available in the UserPreferencesModule context.

Potential solutions:
- If UserPreferencesSchemaModel is a provider, is it part of the current UserPreferencesModule?
- If UserPreferencesSchemaModel is exported from a separate @Module, is that module imported within UserPreferencesModule?
  @Module({
    imports: [ /* the Module containing UserPreferencesSchemaModel */ ]
  })

    at Injector.lookupComponentInParentModules (/Users/davids/Developmet/nestjs/sync-user-preferences/node_modules/@nestjs/core/injector/injector.js:231:19)
    at Injector.resolveComponentInstance (/Users/davids/Developmet/nestjs/sync-user-preferences/node_modules/@nestjs/core/injector/injector.js:184:33)
    at resolveParam (/Users/davids/Developmet/nestjs/sync-user-preferences/node_modules/@nestjs/core/injector/injector.js:106:38)
    at async Promise.all (index 0)
    at Injector.resolveConstructorParams (/Users/davids/Developmet/nestjs/sync-user-preferences/node_modules/@nestjs/core/injector/injector.js:121:27)
    at Injector.loadInstance (/Users/davids/Developmet/nestjs/sync-user-preferences/node_modules/@nestjs/core/injector/injector.js:52:9)
    at Injector.loadProvider (/Users/davids/Developmet/nestjs/sync-user-preferences/node_modules/@nestjs/core/injector/injector.js:74:9)
    at async Promise.all (index 3)
    at InstanceLoader.createInstancesOfProviders (/Users/davids/Developmet/nestjs/sync-user-preferences/node_modules/@nestjs/core/injector/instance-loader.js:44:9)
    at /Users/davids/Developmet/nestjs/sync-user-preferences/node_modules/@nestjs/core/injector/instance-loader.js:29:13

A: O.K, after digging alot I found that the problem was caused because MongooseModule.forFeature name and @InjectModel() in user-preferences.service.ts value were not identical.
They must be identical.

redpajama_set_name: RedPajamaStackExchange


A decade past, humans, gods, and demons joined forces to square against the threat of the stupendous dragon, Bahamut. Now, within the gift, humans living within the capital town of Anatae are enjoying lavish and prosperous lives. Their progress is basically as a result of the administration of the freshly appointed king, Charioce XVII, World Health Organization has taken an influence from the gods and allowed for the abuse and slavery of the demon race within the capital. As humans still amorally exploit demons, a way of hostility against humans begins to make up among demon communities, threatening a revolt. Meanwhile, an environment of uneasiness is spreading among the gods, as they scramble to regain their lost power. Amidst it all, Semitic deity Drango, a cheerful young bounty hunter, has received the Royal Capital with hopes of subsidence down and earning a living. However, her peaceful life within the capital is quickly thrown into chaos once she crosses ways with the ominous Rag Demon World Health Organization is set to hunt revenge against humans, and Kaisar Lidfard, a noble knight battling an indoor ethical conflict. Shingeki no Bahamut: Virgin Soul continues the story of the social and ethical conflict between humans, gods, and demons, and their struggle for survival and dominance.


In the previous update we sent final artwork and book content to the factory for a pre-production test print. Yesterday, those test prints came back, and they look awesome!
With production-ready samples in hand I fired off an email to the factory: Gooooo!
Expect further updates on this process as boxes arrive and packing begins.
As I write, the petition has just hit 16,000 signatories. Wow.
Kyle Midland, Luke Peterson, and 26 more people like this update.
Planning on hosting a themed viewing party with friends as soon as I get my copy. So excited & I'm really hoping the petition pushes EA to approving another game.
I am really looking forward to the art work. I was able to use the art from Madness Returns so well for every detail in creating my Royal Suit Dress. Here's hoping I'll be able to bring another one from Otherlands to life!
When will digital assets be sent out to the digital backers?
I'll help too, just gotta crash on someone's couch or something, I could use a week off. Good luck with all that though, and I'm headed to support the next game now.
The final product looks great! Thank you American and everyone else for all of the hard work! I'm also very confident the Alice game petition will succeed. I backed this kickstarter directly after playing Alice: Madness Returns. I'm glad I wasn't the only one who enjoyed the original/MR. The masses have clearly spoken: we all want to play part 3 EA!
Would gladly help, if you want to supply the round trip ticket.


text:
Farming, Foodshed
Insects + Pollinators
By SHED	| March 4, 2015
Insects are so numerous that, with the number of known species approaching 900,000, they compose 80 percent of all life on Earth. Insects are so numerous that, for every single one pound of humans, there are 300 pounds of insects. Insects are so absolutely amazingly numerous that it's estimated that there are 10 quintillion (10,000,000,000,000,000,000) individual insects alive at any given time. Like right this second.
Here in the United States, we're aware of 91,000 different insect species, but it's estimated that there are 73,000 other insect species of which we're unaware. Beetles lead the population, followed by flies, with the ants/bees/wasps family third, and moths and butterflies the fourth most common.
How many of those are pollinators? Let's go back to counting by quintillions. With numbers like those, it shouldn't be surprising that the sheer volume of insects quite literally in your own backyard is astounding.
We like to use sweep nets, sold in our Healdsburg store, to discover what's living in our grass or hedgerows. Like a long butterfly net — but injurious to and therefore not recommended for butterflies — a sweep net can be used in a gentle figure eight motion over tall grass, its mouth just touching the vegetation.
Gently emptied into a shoe box or onto paper, the sweep net disgorges its contents, a full world of mostly helpful creatures — just 1 percent of insects are considered "pests" — which we mostly ignore.
But pollinators belong to worlds we can no longer ignore. We simply need them too much. According to the U.S. Fish and Wildlife Service, insect pollinators exclusive of honey bees produced $10 billion worth of crops in 2010; honey bees alone produced an additional $19 billion worth of crops that year.
Each of us, however, truly can help. If everyone with the ability to plant even a few pots on a 10th floor patio did so with an eye to the health of our pollinators, we could make an enormous difference.
When considering your garden or patio pots this spring, think of what you can do to benefit our pollinators, those insects, bees, bats, moths, wasps, hummingbirds, and others who help create one third of our food.
You can invite them in, for one thing, and offer a little hospitality. Insect "hotels" are a fun family project to build together or an attractive feature to purchase and add to your garden. (We've got some gorgeous ones onsite at SHED and have built our own, shown above.)
But insects aren't picky. They're happy with some straw or wood, boards, pierced logs, bricks, brambles, and downed branches. What they don't like are sterile environments brimming with pesticides and monoculture plants, like corn and grapes, that don't require insect assistance to reproduce.
Early spring bugs, like such "solitary" bees as the Mason — which have no queen or hive — are a fascinating and important insect to support. Providing a bee "condo" for the Mason is a terrific way to introduce children to the cunning ways of nature. Hollow bamboo rods or straws packed into a can that is nailed on a tree or wall makes a perfect home for Masons and allows you to watch its lonely comings and goings.
We like to encourage bugs that eat the actual pests that eat our plants, like lacewings (they love aphids, mealybugs, whiteflies, thrips and acari eggs), earwigs (aphids), solitary wasps (aphids), and ladybugs (aphids). Anything that eats aphids is fine by us!
We also like diverse flowering plants that bloom at different times, grow to varying heights, produce single flowers with one ring of petals, array in pollinators' favorite blue, purple or yellow colors, and are native to our area. A garden built of healthy, microbe-rich soil produces plants that are naturally resistant to the occasional invasion, no pesticides needed.
Available onsite at SHED, we find Jessica Walliser's Attracting Beneficial Bugs to Your Garden to be an essential text for poison-free planting resulting in a healthy garden with an insect-positive environment.
Among her recommendations is the establishment of a hedgerow, an old-fashioned term that calls to mind the daily trompings of Jane Austen's characters but which can really be little more than an interplanting that assays to stay in an even(ish) line. Composed of small trees and shrubs interspersed with annuals, perennials, and grasses, hedgerows provide shelter to small animals and birds, too.
Writing about hedgerows, California botanical educator Frederique Lavoipierre enthuses that "no hedgerow is complete without buckwheat," adding that "California buckwheat (Eriogonum fasciculatum) may be without peer in attracting great numbers of beneficial insects, pollinators, and predators of numerous pests."
However you do it, consider the unseen this planting season, those quintillion legion who, on their daily rounds, provide the foods upon which we depend. Providing them with a place to live and some lovely flowers to browse seems only hospitable.
This entry was posted in Farming, Foodshed and tagged pollinators.
Meyer Lemon Curd
Leaves & Flowers Nectar Noir Tea


Stage West's Fall and Spring Classes are some of the most affordable in the area! For questions call (817) 554-3613.
A class for our older youth students who wish to dig deeper into the art of theater. We will dive into the craft of acting while learning how to create an original show.
Our theme is inspired by the idea of The Pioneering Spirit--past, present and into the future. Through improvisation, we will devise our own characters, setting, dialogue and dramatic conflict, culminating in an original 10 minute show. Students will learn acting craft to sustain a whole show and engage in the question—where can a pioneering spirit take us now?
1 song, 1 dance, 1 scene. Three professionals from each discipline work with the students to hone skills necessary to be a triple threat in musical theater. Beginners and intermediate levels welcome. The class will result in a mini show-case.
David Haskins will teach voice and song, Morgan Coleman will choreograph and teach dance. Beth Bando Bontley will teach acting and direct the scene.
This class embodies the freedom to play, create, and develop instincts to 'think on your feet.' Creative freedom expands self-confidence and thinking outside the box. The semester ends with a mini showcase of scenes created by the students.
We are offering private coaching services to high school students who will be auditioning for acceptance into college acting or musical theater programs. Please call or education [at] stagewest.org (subject: Audition%20Coaching) (email) us for arrangements.
Class Fees: A $15 admin fee will be added per course.
Rob, a Fort Worth native, is a writer, director & actor. Rob has spent the last decade teaching for Ft. Worth's Stage West Theatre, with whom he has co-founded The Summer Conservatory, The Neighborhood Play Contest & The Festival of the Kid.
Rob is also the creative writing/acting/improv instructor for Artes de la Rosa's Artes Academy at the Rose Marine Cultural Center, with whom he has created over 40 original productions for young audiences. As a director, credits include Death of a Salesman, Sam Shepard's Eyes for Consuela and Waiting for Godot.
Rob is a published writer with several short stories published in literary journals throughout Texas. His original play, The Breeze Through the Cherry Fields, was recently published by the Langdon Review.
Morgan Coleman has trained in dance for over 20 years. She began her training right here in Fort Worth at Dance Connection and continued with masterclasses and Broadway Dance Theatre. She is trained in ballet, jazz, contemporary, modern, hip hop, tap and clogging.
Morgan has performed at numerous venues including Bass Hall and Cowboy Stadium. She has choreographed dance and musical theatre numbers for ages 4 to adult. She loves to work with all different ability levels. She is excited to share her love of dance and performing with a new generation.
David Haskins has a Bachelor's and Master's degree in music from UNT. He served as the musical director for the Dallas Summer Musicals School of Musical Theater for 10 years. This is where multiple collaborations between David and Beth Bando Bontley began, including accompanying her one woman show.
David has been entertaining as a professional pianist for many years and teaching private voice in the Dallas Fort Worth area. He has a growing number of students performing major roles on Broadway. He especially loves to teach serious dance students. David's studio is in Central West Arlington.
* Season Extras Jacob Marley's Christmas Carol and First Date are not included.


Random variables; expectation and variance; laws of large numbers; normal approximation and other limit theorems; multidimensional distributions and transformations. Prerequisite: minimum grade of 2.0 in STAT/MATH 394. Offered: jointly with STAT 395; WSpS.


text:
https://lebronwire.usatoday.com/2019/12/28/report-lebron-james-will-play-saturday-night-at-trail-blazers/
Report: LeBron James will play Saturday night at Trail Blazers
After looking like someone who would play barring a stepback at the Los Angeles Lakers shootaround on Saturday morning, LeBron James will indeed play on Saturday night against the Portland Trail Blazers, according to Chris Haynes of Yahoo Sports.
"I mean pretty much what I normally do but I just added a little bit more treatment to the area," James said on Saturday morning about his process over the last few days. "Some other things to try and fast track it to improve it. A pretty good couple of days after the Christmas Day game."
James confirmed that he was indeed sore after the collision in the Christmas Day game with Patrick Beverley but that the last few days of round the clock treatment have resulted in a healthier groin and the approach of the day that he would play.
LeBron also told reporters on Saturday that playing in a back-to-back Sunday night against the Dallas Mavericks would not be a factor in his decision to play.
Lakers head coach Frank Vogel is expected to speak with the media in approximately 30 minutes but as James is in the arena, it sounds like he's ready to go.
LeBron James says groin 'good,' will decide on playing after shootaround
Lakers deem LeBron James questionable, Anthony Davis probable at Blazers


text:
Q: How to catch 404 errors in Selenium using Perl? I have a Perl script that uses Selenium to fetch a HTML document called foo that doesn't exist (404 not found.) The default behavior is for the script to print an error and terminate, such that "bar" is never printed. I'm looking for a way to get it to continue on instead, such that "bar" is printed.
Here's what I've got. Code (called foo.pl):
#!/usr/bin/perl

use strict;
use WWW::Selenium;

my $sel = WWW::Selenium->new( host => "localhost",
                  port => 4444,
                  browser => "*chrome",
                  browser_url => "http://www.google.com/" );
$sel->start;

$sel->open("http://www.google.com/foo.html")
print "bar";

Here's the message that is printed:
Error requesting http://localhost:4444/selenium-server/driver/?cmd=open&1=http%3A%2F%2Fwww.google.com%2Ffoo.html&sessionId=bc9c086eef804a7c8a0090674333e4c7:
XHR ERROR: URL = http://www.google.com/foo.html Response_Code = 404 Error_Message = Not Found

I've looked all over, but haven't found an answer to this. Thanks!

A: I'm not sure of the implementation in Perl, but in Java, Selenium-RC has a traffic capture mode, defined as selenium.start("captureNetworkTraffic=true"); that will enable you to capture HTTP responses, including error codes. Once the error code is retrieved, you can always resume execution...
Here is an excellent resource on how to capture and process/format this information once retrieved. It uses Python, though, but should give you a start.

A: Alternatively, you can create a (Test::)WWW::Mechanize object in your code (along with your Selenium object), feeding it the same URL that you want Selenium to check, and catching the status from the response object of the Mechanize object. Its a simple approach, I use it for HEAD requests that I issue before I do selenium GET requests.
(Will not work for javascript/ajax requests, though)


text:
\section{Introduction}
Answer set programming (ASP) is nowadays a well-established and successful
programming paradigm based on answer set semantics \cite{GelLif88,MarTru99},
with applications in many areas
(cf., e.g., \cite{Baral,TruszczynskiAppls07,Gelfond07}
and the references therein).
Nevertheless, as noted in \cite{ebserGMS09,BonattiPS08}, few attempts to construct a goal-oriented proof
procedure exist, though there is a renewal of interest, as attested, e.g., by the recent work presented in \cite{MarpleG14}.
This is due to the very nature of the answer set semantics, where a program
may admit none or several answer sets, and where the semantics enjoys no locality, or, better, no
\emph{Relevance} in the sense of \cite{Dix95AeB}: no subset of the given program can in general
be identified, from where the decision of atom $A$ (intended as a goal, or query) belonging or not
to some answer set can be drawn.
An incremental construction of approximations of answer sets is proposed in \cite{ebserGMS09}
to provide a ground for local computations and top-down query answering.
A sound and complete proof procedure is also provided.
The approach of \cite{BonattiPS08} is in the spirit of \as traditional'' SLD-resolution \cite{lloyd93}, and
can be used with non-ground queries and with non-ground, possibly infinite, programs.
Soundness and completeness results are proven for large classes of programs.
Another way to address the query-answering problem is discussed in~\cite{LinYou02}. This work
describes a canonical rewriting system
that turns out to be sound and complete
under the \emph{partial stable model semantics}.
In principle, as the authors observe, the inference procedure could be completed to implement
query-answering w.r.t.\ stable model semantics by circumventing the lack of Relevance.
A substantially different approach to ASP computation is proposed in~\cite{gebsch06c} where
the authors define a tableau-based framework
for ASP. The main aim consists in providing a formal framework for characterizing inference operations and
strategies in ASP-solvers. The approach is not based on query-oriented top-down evaluation, indeed, each
branch in a tableau potentially corresponds to a computation of an answer set.
However, one might foresee the possibility of exploiting such a tableau system to check
answer set existence subject to query satisfaction.

A relevant issue concerning goal-oriented answer-set-based computation is related to sequences of queries.
Assume that one would be able to pose a query $\que Q_1\,$ receiving an
answer \as yes'', to signify that $Q_1$ is entailed by some answer set of the given program $\Pi$.
Possibly, one might intend subsequent queries to be answered in the same \emph{context},
i.e.\ a subsequent query $\que Q_2\,$ might ask whether some of the answer sets entailing $Q_1$ also entails $Q_2$.
This might go on until the user explicitly \as resets'' the context.
Such an issue, though reasonable in practical applications, has been hardly addressed
up to now, due to the semantic difficulties that we have mentioned.
A viable approach to these problems takes inspiration from the research on
RASP (Resource-based ASP), which is a recent extension of ASP,
obtained by explicitly introducing the notion of \emph{resource} \cite{JLC-RASP}.
A RASP and linear-logic modeling of default negation as understood under the answer set semantics has been introduced in \cite{JANCL-RASP-LL}.
This led to the definition of an extension
to the answer set semantics, called \emph{Resource-based Answer Set Semantics} (RAS).
The name of the new semantics comes from the fact that in the linear-logic
formulation every literal (including negative ones) is considered as a resource that is ``consumed'' (and hence it becomes no more available) once used in a proof.
This extension finds an alternative equivalent definition in a variation of the auto-epistemic logic
characterization of answer set semantics discussed in \cite{MarekT93}.

We refer the reader to \cite{DBLP:journals/fuin/CostantiniF15} for a discussion of the new semantics from several
points of view, and to the Appendix for a summary of its formal definition.
Under resource-based answer set semantics there are no inconsistent programs, i.e., every program admits (resource-based) answer set.
Consider for instance the program \(\Pi_1 = \{\old \leftarrow \no \old\}\). Under the answer set
semantics, this program is inconsistent (has no answer sets) because it consists of a unique odd cycle and no supported models exists.
If we extend the program to \(\Pi_2 = \{\old \leftarrow \no \old.\ \ \old \leftarrow \no \young.\}\)
then the resulting program has the answer set $\{old\}$: in fact, the first rule is overridden by the
second rule which allows $\old$ to be derived.
Under the resource-based answer set semantics the first rule is ignored in the first
place: in fact, $\Pi_1$ has a unique resource-based answer set which is the empty set. Intuitively, this results from
interpreting default negation $\no A$ as ``I assume that $A$ is false'' or, in autoepistemic terms \cite{MarTruAEL91,MarTruAELI91}
``I believe that I don't believe $A$''. So, since deriving $A$ accounts to denying the assumption of $\no A$,
such a derivation is disallowed as it would be contradictory. It is not considered to be inconsistent because
default negation is not negation in classical logic: in fact, the attempt of deriving $A$ from $\no A$ in classical
logic leads to an inconsistency, while contradicting one's own assumption is (in our view) simply meaningless,
so a rule such as the one in $\Pi_1$ is plainly ignored. Assume now to further enlarge the program,
by obtaining \(\Pi_3 = \{\old \leftarrow \no \old.\ \ \old \leftarrow \no \young.\ \ \young \leftarrow \old.\}\).
There are again no answer sets, because by combining the last two rules a contradiction
on $\young$ is determined, though indirectly. In resource-based answer set semantics there is still the answer set $\{\old\}$,
as the indirect contradiction is ignored: having assumed $\no \young$ makes $\young$ unprovable.

In standard ASP, a constraint such as $\leftarrow L_1,\ldots,L_h$ where the
$L_i$s are literals is implemented by translating it into the rule
$p \leftarrow \no p, L_1,\ldots,L_h$ with $p$ fresh atom. This is because, in order to
make the contradiction on $p$ harmless, one of the $L_i$s must be false:
otherwise, no answer set exists. Under resource-based answer set semantics
such a transposition no longer works.
Thus, constraints related to a given
program are not seen as part of the program: rather, they
must be defined separately and associated to the program.
Since resource-based answer sets always exist, constraints will possibly
exclude (a-posteriori) some of them. Thus, constraints act as a filter on
resource-based answer sets, leaving those which are \emph{admissible}
with respect to given constraints.

In this paper we discuss a top-down
proof procedure for the new semantics. The proposed procedure, beyond query-answering,
also provides contextualization, via a form of tabling; i.e.,\ a table is associated
with the given program, and initialized prior to posing queries. Such table
contains information useful for both the next and the subsequent queries.
Under this procedure, $\que A\,$ (where we us assume with no loss
of generality that $A$ is an atom), succeeds whenever there exists some
resource-based answer set $M$ where $A \in M$. Contextualization
implies that given a sequence of queries, for instance $\que A, \que B\,$, both queries succeed
if there exists some
resource-based answer set $M$ where $A \in M \wedge B \in M$:
this at the condition of evaluating $\que B\,$ on the program table as left by $\que A\,$
(analogously for longer sequences).
In case the table is reset, subsequent queries will be evaluated independently of previous ones.
Success of $\que A\,$ must then be validated with respect to constraints;
this issue is only introduced here, and will be treated in a future paper.

Differently from~\cite{ebserGMS09}, the proposed procedure
does not require incremental answer set construction when answering a query
and is not based on preliminary program analysis as done in~\cite{MarpleG14}.
Rather, it exploits the fact that resource-based answer set semantics
enjoys the property of Relevance \cite{Dix95AeB} (whereas answer set semantics does not). This guarantees that
the truth value of an atom can be established on the basis of the subprogram it depends upon,
and thus allows for top-down computation starting from a query.
For previous sample programs $\Pi_2$ and $\Pi_3$, query $\que \old$ succeeds, while $\que young$ fails.
W.r.t.~the top-down procedure proposed in \cite{BonattiPS08},
we do not aim at managing
function symbols (and thus programs with infinite grounding), so concerning this aspect our work is more limited.

As answer set semantics and resource-based answer set semantics extend the well-founded
semantics \cite{VGelderRS91}, we take as a starting point XSB-resolution \cite{SwiftW12,ChenW93},
an efficient, fully described and implemented procedure which is correct and
complete w.r.t.\ the well-founded semantics.
In particular, we define RAS-XSB-resolution and discuss
its properties; we prove correctness and completeness for every program (under the new semantics).
We do not provide the full implementation details that we defer to a next step;
in fact, this would imply suitably extending and reworking all operative aspects related to XSB.
Thus, practical issues such as efficiency and optimization
are not dealt with in the present paper and are rather deferred to future work of actual
specification of an implementation.
The proposed procedure is intended
as a proof-of-concept rather than as an implementation guideline.

RAS-XSB resolution can be used for answer set programming under
the software engineering discipline of dividing the program into a consistent \as base'' level
and a \as top'' level including constraints.
Therefore, even to readers not particularly interested in the new semantics,
the paper proposes a full top-down query-answering procedure for ASP,
though applicable under such (reasonable) limitation.

In summary, RAS-XSB-Resolution:
\begin{itemize}
\item
can be used for (credulous) top-down query-answering on logic programs under the resource-based answer set semantics and
possibly under the answer set semantics, given the condition that constraints are defined separately
from the \as main'' program;
\item
it is meant for the so-called \as credulous reasoning'' in the sense that \ given, say, query $\que A\,$
(where $A$ is an atom), it determines whether there exists
any (resource-based) answer set $M$ such that $A \in M$;
\item
it provides \as contextual'' query-answering, i.e.\ it is possible to pose subsequent queries,
say $\que A_1,\ldots, \que A_n$ and, if they all succeed, this means that there exists some
(resource-based) answer set $M$ such that $\{A_1,\ldots,A_n\} \subseteq M$; this extends to the
case when only some of them succeed, where successful atoms are all in $M$ and unsuccessful ones are not;
\item
does not require either preliminary program analysis or incremental answer-set construction, and does
not impose any kind of limitation over the class of resource-based answer set programs which are considered
(for answer set programs, there is the above-mentioned limitation on constraints).
\end{itemize}

This paper is organized as follows. After a presentation of resource-based answer set semantics in Section\rif{rasintro}, we present the proposed query-answering procedure in Section\rif{procedure}, and conclude in Section\rif{conclusions}.
In the rest of the paper, we refer to the standard definitions concerning  propositional general logic programs and ASP \cite{lloyd93,Apt94,Gelfond07}.
If not differently specified, we will implicitly refer to the \emph{ground} version of a program $\Pi$.
We do not consider \as classical negation'',
double negation $\no \no A$,
disjunctive programs, or the various useful programming constructs, such as aggregates,
added over time to the basic ASP paradigm
\cite{simonsEtAl,CosForLPNMR11,FaberPL11}.

\section{Background on Resource-based ASP}\label{rasintro}
The denomination \as resource-based'' answer set semantics (RAS) stems from the linear logic
formulation of ASP (proposed in \cite{JANCL-RASP-LL,DBLP:journals/fuin/CostantiniF15}),
which constituted the original inspiration for the new semantics.
In this perspective, the negation $\no A$ of some atom $A$ is
considered to be a \emph{resource} of unary amount, where:
\begin{itemize}
\item $\no A$ is \emph{consumed} whenever it is used in a proof, thus
preventing $A$ to be proved, for retaining consistency;
\item $\no A$ becomes no longer available whenever $A$ is proved.
\end{itemize}

Consider for instance the following
well-known sample
answer set program consisting of a ternary odd cycle and
concerning someone who wonders where to spend
her vacation:

\smallskip\noindent{$
\begin{array}{l}
~~~~~~\mathit{beach} \ar \no \mathit{mountain}. ~~~~~
\mathit{mountain} \ar \no \mathit{travel}. ~~~~~
\mathit{travel} \ar \no \mathit{beach}.
\end{array}$}

\smallskip\noindent
In ASP, such program is inconsistent. Under the new semantics, there are the following three resource-based answer sets:
~$\{\mathit{beach}\}$,~ $\{\mathit{mountain}\}$, and $\{\mathit{travel}\}$.
Take for instance the
first one, $\{\mathit{beach}\}$.
In order to derive the conclusion $\mathit{beach}$ the first rule can be used; in doing so, the premise $\no \mathit{mountain}$ is consumed, thus disabling the possibility of proving $\mathit{mountain}$, which thus becomes false; $\mathit{travel}$ is false as well, since it depends from a false premise.

We refer the reader to \cite{DBLP:journals/fuin/CostantiniF15} for a detailed discussion about
logical foundations, motivations, properties, and complexity, and for examples of use.
We provide therein characterizations of RAS in terms of linear logic, as a variation of the answer set semantics, and in terms of autoepistemic logic.
Here we just recall that, due to the ability to cope with odd cycles, under RAS it is always possible to
assign a truth value to all atoms:
every program in fact admits at least one (possibly empty) resource-based answer set.
A more significant example is the following (where, albeit in this paper we
	focus on the case of ground programs, for the sake of conciseness we make use of variables, as customary done to denote collections of ground literals/rules).
The program models a recommender agent, which provides a user with indication to where it is possible to spend the evening, and how the user should dress for such an occasion. The system is also able to take user preferences into account.

The resource-based answer set program which constitutes the core of the system is the following. There are two ternary cycles. The first one specifies that a person can be dressed either formally or normally or in an eccentric way. In addition, only old-fashioned persons dress formally, and only persons with a young mind dress in an eccentric way. Later on, it is stated by two even cycles that any person can be old-fashioned or young-minded, independently of the age that, by the second odd cycle, can be young, middle, or old. The two even cycles interact, so that only one option can be taken.
Then, it is stated that one is admitted to an elegant restaurant if (s)he is formally dressed, and to a disco if (s)he is dressed in an eccentric way. To spend the evening either in an elegant restaurant or in a disco one must be admitted. Going out in this context means either going to an elegant restaurant (for middle-aged or old people) or to the disco for young people, or sightseeing for anyone.

\smallskip
\noindent{\small
$\tbm~formal\_dress(P)\ \ar \ person(P), \no normal\_dress(P), old\_fashioned(P).$\\
$\tbm~normal\_dress(P)\ \ar \ person(P), \no eccentric\_dress(P).$\\
$\tbm~eccentric\_dress(P)\ \ar \ person(P), \no formal\_dress(P), young\_mind(P).$\\
$\tbm~old(P)\ \ar \ person(P), \no middleaged(P).$\\
$\tbm~middleaged(P)\ \ar \ person(P), \no young(P).$\\
$\tbm~young(P)\ \ar \ person(P), \no old(P).$\\
$\tbm~old\_fashioned(P)\ \ar\ person(P), \no young\_mind(P), \no noof(P).$\\
$\tbm~noof(P)\ \ar \ person(P), \no old\_fashioned(P).$\\
$\tbm~young\_mind(P)\ \ar\ person(P), \no old\_fashioned(P), \no noym(P).$\\
$\tbm~noym(P)\ \ar\ person(P), \no young\_mind(P).$\\
$\tbm~admitted\_elegant\_restaurant(P)\ \ar\ person(P), formal\_dress(P).$\\
$\tbm~admitted\_disco(P)\ \ar\ person(P), eccentric\_dress(P).$\\
$\tbm~go\_disco(P)\ \ar person(P), young(P), admitted\_disco(P).$\\
$\tbm~go\_elegant\_restaurant(P)\ \ar person(P),admitted\_elegant\_restaurant(P).$\\
$\tbm~go\_elegant\_restaurant(P)\ \ar person(P), middleaged(P),admitted\_elegant\_restaurant(P).$\\
$\tbm~go\_sightseeing(P)\ \ar\ person(P).$\\
$\tbm~go\_out(P)\ \ar middleaged(P),go\_elegant\_restaurant(P).$\\
$\tbm~go\_out(P)\ \ar old(P),go\_elegant\_restaurant(P).$\\
$\tbm~go\_out(P)\ \ar young(P),go\_disco(P).$\\
$\tbm~go\_out(P)\ \ar go\_sightseeing(P).  $}
\smallskip

The above program, if considered as an answer set program, has a (unique) empty resource-based answer set, as there are no facts
(in particular there are no facts for the predicate $\mathit{person}$ to provide values for the placeholder $P$).

Now assume that the above program is incorporated into an interface system which interacts with a user, say George, who wants to go out and wishes to be made aware of his options.
The system may thus add the fact  $\mathit{person(george)}$ to the program.
While, in ASP the program would become inconsistent, in RASP the system would, without any more information, advise George to go sightseeing.
This is, in fact, the only advice that can be extracted from the unique resource-based answer set of the resulting program. If the system might obtain or elicit George's age, the options would be many more, according to the hypotheses about him being old-fashioned or young-minded. Moreover, for each option (except sightseeing) the system would be able to extract
the required dress code. George might want to express a preference, e.g., going to the disco. Then the system might add to the program the rule

\smallskip\noindent{
\(\tbm~\mathit{preference(P)}\ \ar \mathit{person(P),\ go\_disco(P)}.\)}

\smallskip\noindent
and state the constraint $\ar \no \mathit{preference(P)}$ that \as forces'' the preference to be satisfied,
thus making George aware of the hypotheses and conditions under which he might actually go to the disco.
Namely, they correspond to the unique resource-based answer set where George is young, young-minded and
dresses in an eccentric way.

However, in resource-based answer set semantics
constraints cannot be modeled (as done in ASP) as \as syntactic sugar'', in terms of unary odd cycles
involving fresh atoms. Hence, they have to be modeled explicitly.
Without loss of generality, we assume, from now on, the following simplification concerning constraints.
Each constraint $\ar L_1,\ldots,L_k$, where
each $L_i$ is a literal, can be rephrased as simple constraint $\ar H$,
where $H$ is a fresh atom, plus rule $H \ar L_1,\ldots,L_k$ to be added to the given program $\Pi$.
So, $H$ occurs in the set $S_{\Pi}$ of all the atoms of $\Pi$.

\begin{definition}
	\label{admissible}
	Let $\Pi$ be a program and $\mathcal{C}=\{\mathcal{C}_1,\ldots,\mathcal{C}_k\}$ be a set
	of constraints, each $\mathcal{C}_i$ in the form $\ar H_i$.
	\begin{itemize}
		\item
		A resource-based answer set $M$ for $\Pi$ is \emph{admissible} w.r.t.\ $\mathcal{C}$
		if for all $i \leq k$ where $H_i \not\in M$.
		\item
		The program $\Pi$ is called \as admissible'' w.r.t.\ $\mathcal{C}$
		if it has an admissible answer w.r.t.\  $\mathcal{C}$.
	\end{itemize}
\end{definition}

It is useful for what follows to evaluate RAS with respect to general
properties of semantics of logic programs introduced in \cite{Dix95AeB},
that we recall below (see the mentioned article for the details).
A semantic $SEM$ for logic programs is intended as a function
which associates a logic program with a set of sets of atoms, which constitute the intended meaning.
\begin{definition}
Given any semantics $SEM$ and a ground program $\Pi$,
\emph{Relevance} states that for all literals $L$ it holds that $SEM(\Pi)(L) = SEM(\mathit{rel\_rul}(\Pi;L))(L)$.
\end{definition}
Relevance implies that the truth value of any literal under that
semantics in a given program, is determined solely by the subprogram consisting of the relevant rules.
The answer set semantics does not enjoy Relevance  \cite{Dix95AeB}.
This is one reason for the lack of goal-oriented proof procedures. Instead, it is easy to see that resource-based answer set semantics enjoys Relevance.

Resource-based answer set semantics, like most semantics for logic programs with negation,
enjoys \emph{Reduction}, which simply assures that the
atoms not occurring in the heads of a program are always assigned truth value false.

Another important property is \emph{Modularity}, defined in~\cite{Dix95AeB} as follows
(where the reduct $\Pi^M$ of program $\Pi$ w.r.t.\ set of atoms $M$):

\begin{definition}
Given any semantics $SEM$, a ground program $\Pi$ let $\Pi = \Pi_1 \cup \Pi_2$
where for every atom $A$ occurring in $\Pi_2$, $\mathit{rel\_rul}(\Pi;A) \subseteq \Pi_2$.
We say that SEM enjoys \emph{Modularity}
if it holds that $\,SEM(\Pi) = SEM(\Pi_1^{SEM(\Pi_2)} \cup \Pi_2)$.
\end{definition}
If Modularity holds, then the semantics can be always computed
by splitting a program in its subprograms (w.r.t.\ relevant rules).
Intuitively, in the above definition, the semantics of $\Pi_2$, which is self-contained, is first computed. Then, the semantics
of the whole program can be determined by reducing $\Pi_1$  w.r.t.\ $SEM(\Pi_2)$.
We can state (as a consequence of Relevance and of Proposition\rif{decomposition} in the Appendix) that resource-based answer set semantics enjoys Modularity.
\begin{proposition}
\label{modularity}
Given a ground program $\Pi$ let $\Pi = \Pi_1 \cup \Pi_2$,
where for every atom $A$ occurring in $\Pi_2$, $\mathit{rel\_rul}(\Pi;A) \subseteq \Pi_2$.
A set $M$ of atoms is a resource-based answer set of $\Pi$ iff there exists a resource-based answer set $S$ of $\Pi_2$
such that $M$ is a resource-based answer set of $\Pi_1^{S} \cup \Pi_2$.
\end{proposition}

Modularity
also impacts on constraint checking, i.e.\ on the check of admissibility
of resource-based answer sets. Considering, in fact, a set of constraints $\{\mathcal{C}_1,\ldots,\mathcal{C}_n\}$, $n > 0$,
each $\mathcal{C}_i$ in the form $\ar{}H_i$, and letting for each
$i \leq n$ $\mathit{rel\_rul}(\Pi;H_i) \subseteq \Pi_2$, from Proposition\rif{modularity} it follows that,
if a resource-based answer set $X$ of $\Pi_2$ is admissible (in terms of Definition\rif{admissible}) w.r.t.\ $\{\mathcal{C}_1,\ldots,\mathcal{C}_n\}$,
then any resource-based answer set $M$ of $\Pi$ such that $X \subseteq M$ is also admissible w.r.t.\ $\{\mathcal{C}_1,\ldots,\mathcal{C}_n\}$.
In particular, $\Pi_2$ can be identified in relation to a certain query:
\begin{definition}\label{relevantforquery}
Given a program $\Pi$, a constraint $\ar{}H$ associated to $\Pi$
is \emph{relevant for query} $\que A\,$ if
$\mathit{rel\_rul}(\Pi;A) \subseteq \mathit{rel\_rul}(\Pi;H)$.
\end{definition}

\section{A Top-down Proof Procedure for RAS}
\label{procedure}

As it is well-known, the answer set semantics extends the well-founded semantics (wfs) \cite{VGelderRS91}
that provides a unique three-valued model $\langle  W^{+}, W^{-}\rangle$,
where atoms in $W^{+}$ are \emph{true}, those in $W^{-}$ are \emph{false},
and all the others are \emph{undefined}. In fact, the answer set semantics assigns,
for consistent programs
truth values
to the undefined atoms. However the program can be \emph{inconsistent}
because of odd cyclic dependencies.
The improvement of resource-based answer set semantics
over the answer set semantics relies exactly on its ability to deal with odd cycles that
the answer set semantics interprets as inconsistencies.
So, in any reasonable potential query-answering device for ASP,
a query $\que A\,$ to an ASP program $\Pi$ may be reasonably expected
to succeed or fail if $A$ belongs to $W^{+}$ or $W^{-}$, respectively.
Such a procedure will then be characterized according to
how to provide an answer when $A$ is undefined under the wfs.

An additional problem with answer set semantics is that query $\que A\,$
might \emph{locally} succeed, but still, for the lack of Relevance, the overall program may not have answer sets.
In resource-based answer set semantics instead,
every program has one or more resource-based answer set:
each of them taken singularly is then admissible or not w.r.t.\ the integrity constraints.
This allows one to perform constraint checking upon success of query $\que A$.

We will now define the foundations of a top-down proof procedure for resource-based
answer set semantics, which we call RAS-XSB-resolution. The procedure has to deal
with atoms involved in negative circularities,
that must be assigned a truth value according to some resource-based
answer set. We build upon XSB-resolution, for which
an ample literature exists, from the seminal work in \cite{ChenW93} to the
most recent work in \cite{SwiftW12} where many useful references can also be found.
For lack of space XSB-resolution is not described here.
XSB in its basic version, XOLDTNF-resolution \cite{ChenW93}
is shortly described in the Appendix.
We take for granted basic notions concerning proof procedures for
logic programming, such as for instance backtracking. For
the relevant definitions we refer to \cite{lloyd93}.
Some notions are however required here for the understanding of what follows.
In particular, it is necessary to illustrate detection of cycles on negation.
\begin{definition}[XSB Negative Cycles Detection]
	\label{negcycdet}
	\begin{itemize}
		\item
		Each call to atom $A$ has an associated set $N$ of negative literals,
		called the \emph{negative context} for $A$, so the call takes the form $(A,N)$.
		\item
		Whenever a negative literal\, $\no B$\, is selected during the evaluation of some $A$, there are two
		possibilities: (i) $\no B \not\in N$: this will lead to the call $(B, N \cup \{\no B\})$;
		(ii) $\no B \in N$, then there is a possible negative loop, and $B$ is called a \emph{possibly looping negative literal}.
		\item
		For the initial call of any atom $A$, $N$ is set to empty.
	\end{itemize}
\end{definition}

In order to assume that a literal $\no B$ is a looping negative literal, that in XSB assumes truth value \emph{undefined},
the evaluation of $B$ must however be \emph{completed}, i.e.\ the search space must have been fully explored
without finding conditions for success or failure.

Like in XSB, for each program $\Pi$ a table \tabp\ records useful
information about proofs. As a small extension w.r.t. XSB-Resolution, we
record in \tabp\ not only successes, but also
failures.
XSB-resolution is, for Datalog programs, correct and complete w.r.t.\  the wfs.
Thus, it is useful to state the following definition.
\begin{definition}
	Given a program $\Pi$ and an atom $A$, we say that
	\begin{itemize}
		\item
		$A$ \emph{definitely succeeds} iff it succeeds via
		XSB- (or, equivalently, XOLDTNF-) resolution, and thus $A$ is recorded in {\tabp} with truth value \emph{true}.
		For simplicity, we assume $A$ occurs in~{\tabp}.
		\item
		$A$ \emph{definitely fails} iff it fails via
		XSB- (or, equivalently, XOLDTNF-) resolution, and thus $A$ is recorded in {\tabp} with truth value \emph{false}.
		For simplicity, we assume {$\no A$} occurs in {\tabp}.
	\end{itemize}
\end{definition}

To represent the notion of negation as a resource, we initialize
the program table prior to posing queries and we manage the table
during a proof so as to state that:
\begin{itemize}
	\item the negation of any atom
	which is not a fact is available unless this atom has been proved;
	\item the negation of an atom which has been proved becomes unavailable;
	\item the negation of an atom which cannot be proved is always available.
\end{itemize}

\begin{definition}
[Table Initialization in RAS-XSB-resolution]
\label{init-tabp}
Given a program $\Pi$ and  an associated table \tabp, \emph{Initialization} of \tabp\
is performed by inserting,
for each atom $A$ occurring as the
conclusion of some rule in $\Pi$, a fact $\yesA$ (where $\yesA$ is a fresh atom).
\end{definition}

The meaning of $\yesA$ is that the negation $\no A$ of $A$ has not been proved.
If $\yesA$ is present in the table, then $A$ can possibly succeed.
Success of $A$ \as absorbs'' $\yesA$ and prevents $\no A$ from success.
Failure of $A$ or success of $\no A$ \as absorbs'' $\yesA$ as well, but $\no A$ is asserted.
\tabp\ will in fact evolve
during a proof into subsequent states, as specified below.
\begin{definition}
	[Table Update in RAS-XSB-resolution]
	\label{upd-tabp}
Given a program $\Pi$ and  an associated table \tabp,
referring to the definition of RAS-XSB-resolution (cf. Definition\rif{succfail} below), the  table update is performed as follows.
\begin{itemize}
\item
Upon success of subgoal $A$,  $\yesA$
is removed from \tabp
\ and $A$ is added to \tabp.
\item
Upon failure of subgoal $A$, $\yesA$ is removed from \tabp
\ and $\no A$ is added to \tabp.
\item
Upon success of subgoal $\no A$,
$\yesA$ is removed from \tabp\ and
$\no A$ is added to \tabp.
However:
\begin{itemize}
\item[-] if $\no A$ succeeds by case 3.b, then such modification is permanent;
\item[-]  if $\no A$ succeeds either by case 3.c or by case 3.d, then in case of failure of the parent subgoal the modification is retracted, i.e.\
$\yesA$ is restored in \tabp\ and $\no A$ is removed from \tabp.
\end{itemize}
\end{itemize}
\end{definition}

We refer the reader to the examples provided below for a clarification of the
table-update mechanism.
In the following, without loss of generality we can assume that a query is of the
form $\que A$, where $A$ is an atom.
Success or failure of this query is established as follows.
Like in XSB-resolution, we assume that the call to query $A$ implicitly corresponds to
the call $(A,N)$ where $N$ is the negative context of $A$, which is initialized to $\emptyset$
and treated as stated in Definition\rif{negcycdet}.
\begin{definition}
[Success and failure in RAS-XSB-resolution]
\label{succfail}
Given a program $\Pi$ and its associated table \tabp, notions of success and failure
and of modifications to \tabp\ are extended as follows with respect to XSB-resolution.
\begin{itemize}
\item[(1)]
Atom $A$ succeeds iff $\yesA$ is present in \tabp, and one of the following conditions holds.
\begin{itemize}
\item[(a)]
$A$ definitely succeeds (which includes the case where $A$ is present in \tabp).
\item[(b)]
There exists in $\Pi$ either fact $A$ or a rule of the form
$A \ar L_1,\ldots,L_n$, $n > 0$, such that neither $A$ nor $\no A$ occur in the body and every literal  $L_i$, $i \leq n$, succeeds.
\end{itemize}
\item[(2)]
Atom $A$ fails iff one of the following conditions holds.
\begin{itemize}
\item[(a)]
$\yesA$ is not present in \tabp.
\item[(b)]
$A$ definitely fails.
\item[(c)]
There is no rule of the form $A \ar L_1,\ldots,L_n$, $n > 0$, such that every literal $L_i$ succeeds.
\end{itemize}
\item[(3)]
Literal $\no A$ succeeds if one of the following is the case:
\begin{itemize}
\item[(a)]
$\no A$ is present in \tabp.
\item[(b)]
$A$ fails.
\item [(c)]
$\no A$ is \emph{allowed to succeed}.
\item[(d)]
$A$ is \emph{forced to failure}.
\end{itemize}
\item[(4)]
Literal $\no A$ fails if $A$ succeeds.
\item[(5)]
$\no A$ is \emph{allowed to succeed}
whenever the call $(A,\emptyset)$ results,
whatever sequence of derivation steps is attempted, in the call $(A,N\cup\{\no A\})$.
I.e., the derivation of $\no A$ incurs through layers of negation again into $\no A$.
\item[(6)]
$A$ is \emph{forced to failure} when the call $(A,\emptyset)$ always results in the call $(A, \{\no A\})$,
whatever sequence of derivation steps is attempted.
I.e., the derivation of $\no A$ incurs in $\no A$ directly.
\end{itemize}
\end{definition}

{F}rom the above extension of the notions of success and failure we obtain
RAS-XSB-resolution as an extended XSB-resolution.
Actually, in the definition we exploit XSB (or, more precisely, XOLDTNF), as a \as plugin'' for definite
success and failure, and we add cases which manage subgoals with answer \emph{undefined} under XSB.
This is not exactly ideal from an implementation point of view. In future work, we intend to proceed to a much more
effective integration of XSB with the new aspects that we have introduced, and to consider efficiency
and optimization issues that are presently neglected.

Notice that the distinction between RAS-XSB-resolution and XSB-resolution
is determined by cases 3.c and 3.d of Definition\rif{succfail}, which manage literals
involved in negative cycles. The notions of \emph{allowance to succeed} (case~5) and of \emph{forcing to failure} (case~6)
are crucial.
Let us illustrate the various cases via simple examples:
\begin{itemize}
\item
Case 3.c deals with literals depending negatively upon themselves through other negations.
Such literals can be assumed as \emph{hypotheses}. Consider, for example, the program $a \ar \no b.\;~ b \ar \no a.~$
Query $\que a\:$ succeeds by assuming $\no b$, which is correct w.r.t.\ (resource-based) answer set $\{a\}$.
If, however, the program is $a \ar \no b,\no e.\;~ b \ar \no a.\;~ e.$ then, the same query $\que a\:$ fails upon definite failure
of $\no e$, so the hypothesis $\no b$ must be retracted. This is, in fact, stated in the specification
of table update (Definition\rif{upd-tabp}).
\item
Case 3.d deals with literals depending negatively upon themselves directly.
Such literals can be assumed as \emph{hypotheses}. Consider,  for example, the program $p \ar a.\;\ a \ar \no p.$.
Query $\que a\:$ succeeds because the attempt to prove $\no p$ comes across $\no p$  (through $a$),
and thus $p$ is forced to failure. This is correct w.r.t.\ resource-based answer set $\{a\}$.
Notice that for atoms involved in negative cycles the positive-cycle detection is relaxed, as some atom in
the cycle will either fail or been forced to failure.
If however the program is $p \ar a.\;\ a \ar \no p,\no q.$ then, the same query $\que a\:$ fails upon definite failure
of $\no q$, so the hypothesis $\no p$ must be retracted. This is in fact stated in the specification
of table update (Definition\rif{upd-tabp}).
\end{itemize}

We provide below a high-level definition of the overall proof procedure
(overlooking implementation details), which resembles plain SLD-resolution.

\begin{definition}[A naive RAS-XSB-resolution]
\label{ras-xsb}
Given a program $\Pi$, let assume as input the data structure \tabp\  used by the proof
procedure for tabling purposes, i.e.\ the table associated with the program.
Given a query $\que A$, the list of current subgoals
is initially set to ${\cal{L}}_1 = \{A\}$.
If in the construction of a proof-tree for $\que A\,$
a literal $L_{i_j}$ is selected in the list
of current subgoals ${\cal{L}}_i$, we have that: if $L_{i_j}$ succeeds
then we take $L_{i_j}$ as proved and proceed to prove
$L_{i_{j+1}}$ after the related updates to the program table.
Otherwise, we have to backtrack to
the previous list ${\cal{L}}_{i-1}$ of subgoals.
\end{definition}
Conditions for success and failure are those specified in Definition\rif{succfail}.
Success and failure determine the modifications to \tabp\
specified in Definition\rif{upd-tabp}.
Backtracking does not involve restoring previous contents of \tabp,
as subgoals which have been proved can be usefully employed as lemmas.
In fact, the table is updated only when the entire search space for a subgoal has
been explored.
The only exception concerns negative subgoals which correspond to literals involved
in cycles: in fact, they are to considered as hypotheses that could later be retracted.

For instance, consider the program
\\$\tbm~
q \ar \no a,c.~~~~~~~~~~
q \ar \no b.~~~~~~~~~~
a \ar \no b.~~~~~~~~~~
b \ar \no a.
$

\noindent
and query $\que q$. Let us assume clauses are selected in the order.
So, the first clause for $q$ is selected, and $\no a$ is initially allowed to succeed (though involved in a negative cycle with $\no b$).
However, upon failure of subgoal $c$ with consequent backtracking to the second rule
for $q$, lemma $\no A$ must be retracted from the table: this in fact enables $\no b$ to be allowed to succeed, so determining
success of the query.

\begin{definition}
Given a program $\Pi$ and its associated table \tabp,
a \emph{free query} is a query $\que A\,$ which is posed on $\Pi$ when the table
has just been initialized. A \emph{contextual query} is a query $\que B\,$
which is posed on $\Pi$ leaving the associated table in the state determined by former queries.
\end{definition}

Success of query $\que A\,$ means
(as proved in Theorem\rif{correctcomplete} below) that there exist resource-based answer sets that contain $A$. The final content of \tabp\
specifies literals that hold in these sets (including $A$). Precisely, the state of \tabp\ characterizes a set ${\cal S}_{{\mbox{\tiny\tabp}}_A}$
resource-based answer sets of $\Pi$, such that for all $M \in {\cal S}_{{\mbox{\tiny\tabp}}_A}$, and for every atom $D$, $D \in  \tabp$ implies
$D \in M$
and $\no D \in \tabp$ implies
$D \not\in M$.
Backtracking on $\que A\,$ accounts to asking whether there are other different resource-based answer sets containing $A$, and implies making different assumptions about cycles by retracting literals which had been assumed to succeed.
Instead, posing a subsequent query $\que B\,$ without resetting the contents of \tabp, which constitutes a \emph{context}, accounts to asking whether some of the
answer sets in ${\cal S}_{{\mbox{\tiny\tabp}}_A}$ also contain $B$.
Posing such a contextual query, the resulting table reduces previously-identified resource-based answer sets to a possibly smaller set
${\cal S}_{{\mbox{\tiny\tabp}}_{A\cup B}}$
whose elements include both $A$ and $B$
(see Theorem\rif{contextcc} below).
Contextual queries and sequences of contextual queries are formally defined below.

\begin{definition}[Query sequence]
\label{q-seq}
Given a program $\Pi$ and $k > 1$ queries $\que A_1$, \ldots, $\que A_k$
performed one after the other, assume that
\tabp\ is initialized only before posing $\que A_1$. Then, $\que\,A_1\,$ is a {free query}
where each $\que A_i$, is a \emph{contextual query}, evaluated w.r.t.\ the previous ones.
\end{definition}

To show the application of RAS-XSB-resolution to single queries and to a query sequence, let us consider the
sample following program $\Pi$, which includes virtually all cases of potential success
and failure.
The well-founded model of this program is $\langle \{e\}, \{d\}\rangle$ while
the resource-based answer sets are $M_1 = \{a,e,f,h,s\}$ and $M_2 = \{e,h,g,s\}$.
\\\centerline{\begin{tabular}{lclclcl}
		{
			$
			\begin{array}{l}
\phantom{\overline{\overline{|}}}			r_1.\ \ a\ar \no g.\\
\phantom{\underline{\underline{|}}} 			r_2.\ \ g\ar \no a.\\
			\end{array}
			$
		}
		&~~&
		{
			$
			\begin{array}{l}
			r_3.\ \ s\ar \no p.\\
			r_4.\ \ p\ar h.\\
			\end{array}
			$
		}
		&~~&
		{
			$
			\begin{array}{l}
			r_5.\ \ h\ar \no p.\\
			r_6.\ \ f\ar \no a,d.\\
			\end{array}
			$
		}
		&~~&
		{
			$
			\begin{array}{l}
			r_7.\ \ f\ar \no g,e.\\
			r_8.\ \ e.
			\end{array}
			$
		}
	\end{tabular}}

Initially, \tabp\  includes $\yesA$ for every atom occurring in some rule head:
$\ttabp=\{\mathit{yesa}$,$\mathit{yesb}$,$\mathit{yesc}$,$\mathit{yese}$,$\mathit{yesf}$,$\mathit{yesg}$,$\mathit{yesp}$,$\mathit{yesh}$,$\mathit{yess}\}$.
Below we illustrate some derivations.
We assume
that applicable rules are considered from first ($r_1$) to last ($r_8$) as they are ordered in the program,
and literals in rule bodies from left to right.

Let us first illustrate the proof of query $\que f$.
Each additional layer of $\que$ indicates nested derivation of $A$
whenever literal $\no A$ is encountered.
In the comment, we refer to cases of RAS-XSB-resolution as specified in Definition\rif{succfail}.
Let us first consider query $\que f$.

\smallskip
{
	\noindent$
	\begin{array}{l@{\hspace{0.0ex}}l}
	\que f.\\
	\que \no a,d. \phantom{\que}&\tbs\%\ \mbox{via\ }r_6\\[0.2ex]
	\end{array}
	$

\noindent
Subgoal $\no a$ is treated as follows.

	\noindent$
	\begin{array}{l@{\hspace{0.0ex}}l}
	\que\que a. &\\
	\que\que \no g.\tbs\phantom{\que}&\%\ \mbox{via\ }r_1\\
	\que\que\que g.&\\
	\que\que\que \no a. \tbs&\%\ \mbox{via\ }r_2.\ \no a \mbox{\ succeeds by case 3.c,\ } \ttabp = \ttabp \cup \{\no a\} \setminus \{\mathit{yesa}\}\\[0.2ex]
	\end{array}
	$

\noindent
Subgoal $d$ gives now rise to the following derivation.

	\noindent$
	\begin{array}{l@{\hspace{0.0ex}}l}
	\que d. \tbs &\%\ \ d \mbox{\ fails by case 2.b, so the parent goal $f$ fails.} \\[0.5ex]
	\multicolumn{2}{l}{\!\!\!\!\mbox{Backtracking is however possible, as there exists a second rule for $f$.}}\\
	\que \no g,e. \tbs &\%\ \ \mbox{via\ }r_7\\
	\que\que g. &\\
	\que\que \no a. \tbs\phantom{\que} &\%\ \ \mbox{via\ }r_2\\
	\que\que\que a.\\
	\que\que\que \no g. \tbs &\%\ \ \mbox{via\ }r_1. \mbox{Thus,\ } \no g \mbox{\ succeeds by case 3.c.} \ttabp = \ttabp \cup \{\no g\} \setminus \{\mathit{yesg}\}
	\end{array}
	$

	\noindent$
	\begin{array}{l@{\hspace{0.0ex}}l}
	\multicolumn{2}{l}{\!\!\!\!\mbox{Now, the second subgoal $e$ remains to be completed:}}\\
	\que e. \tbs &\%\ \ e \mbox{\ succeeds by case 1.b,}\ \mbox{and the overall query $f$ succeeds by case 1.b.}\\
	&\phantom{\%\ \ }\ttabp = \ttabp \cup \{e, f\}\ \setminus\ \{\mathit{yese,yesf}\}
	\end{array}
	$
}

\medskip\noindent
Assuming now to go on to query the same context, i.e.\ without re-initializing
\tabp, {query $\que g\,$ quickly fails by case 2.a
since $\no g \in \ttabp$}.
Query $\que e\,$ succeeds immediately by case 1.a
as $e \in \ttabp$. We can see that the context we are within corresponds
to resource-based answer set~$M_1$. Notice that, if resetting the context,
 $\que g\,$ would instead succeed as by case 1.b as $\no a$ can be allowed
 to succeed by case 3.c.
Finally, a derivation for $\que s\,$ is obtained as follows:

\smallskip
{
\noindent
$\begin{array}{l@{\hspace{0.0ex}}l}
\que s.&\\
\que \no p. \tbs&\%\ \ \mbox{via\ }r_3\\
\que\que p.&\\
\que\que h.\tbs\phantom{\que}&\%\ \ \mbox{via\ }r_4
\\
\que\que \no p. \tbs\phantom{\que}&\%\ \ \mbox{via\ }r_5,\
{\no p \mbox{\ succeeds by case 3.d, and $p$ is forced to failure}
}\\
&\phantom{\%\ \ }\ttabp = \ttabp \cup \{\mathit{\no p}\} \setminus \{\mathit{yesp, yesh}\}.
\end{array}
$
}

\smallskip\noindent
Then, at the upper level,
$s$ and $h$ succeed by case 1.b, and
$\ttabp \cup \{s\} \setminus \{\mathit{yess}\}$.
Notice that forcing $p$ to failure determines $\no p$ to succeed, and consequently allows $h$ to succeed
(where $h$ is undefined under the wfs).
The derivation of $h$
involves the tricky case of a positive dependency through negation.

\subsection{Properties of RAS-XSB-resolution}\label{Sect_PropOfRAS-XSB}
Properties of resource-based answer set semantics are strictly related to properties
of RAS-XSB-resolution. In fact, thanks to
Relevance we have soundness and completeness, and
Modularity allows for contextual query and locality in constraint-checking.
Such properties are summarized in the following Theorems (whose proofs can be found in Appendix).

\begin{theorem}
\label{correctcomplete}
\label{cc}
RAS-XSB-resolution is correct and complete w.r.t.\ resource-based answer set semantics,
in the sense that, given a program $\Pi$, a query $\que A\,$ succeeds under RAS-XSB-resolution
with an initialized \tabp\  iff there exists resource-based answer set $M$ for $\Pi$
where $A\in M$.
\end{theorem}
\begin{theorem}
	\label{contextcc}
RAS-XSB-resolution is contextually correct and complete w.r.t.\ resource Answer Set semantics,
in the sense that, given a program $\Pi$ and a query sequence $\que A_1$, \ldots, $\que A_k$, $k > 1$, where \(\{A_1, \ldots, A_k\} \subseteq S_{\Pi}\) (i.e.\ the $A_i$s are atoms occurring in $\Pi$),
we have that, for $\{B_1, \ldots, B_r\}\subseteq \{A_1, \ldots, A_k\}$ and $\{D_1, \ldots, D_s\} \subseteq \{A_1, \ldots, A_k\}$,
the queries $\que B_1$, \ldots, $\que B_r$ succeed while $\que D_1$, \ldots, $\que D_s$
fail under RAS-XSB-resolution,
iff there exists resource-based answer set $M$ for $\Pi$
where $\{B_1, \ldots, B_r\} \subseteq M$ and $\{D_1, \ldots, D_s\} \cap M = \emptyset$.
\end{theorem}
This result extends immediately to queries including negative literals such as $\no H$, $H \in S_{\Pi}$.
We say that a query sequence contextually succeeds if each of the involved queries succeeds in
the context (table) left by all former ones.

We defer a discussion of constraint checking to a future paper.
Notice only that, given an admissible program $\Pi$
and a constraint $\ar C$ (where $C$ is an atom), success of the query
$\que \no C\,$ in a certain context (given by $\tabp$) means that this constraint is fulfilled in the admissible resource-based answer sets $\Pi$ selected by that context.
If the context where $\que \no C\,$  is executed results from a query $\que A$, this implies by Theorem\rif{contextcc} that
$\ar C$ is fulfilled at least one
admissible resource-based answer set including $A$.
So, in admissible programs one should identify and check (a posteriori)
constraints that are \emph{relevant} to the query according to Definition\rif{relevantforquery}.

\section{Concluding Remarks}
\label{conclusions}

A relevant question about RAS-XSB-resolution is whether it might be applicable to non-ground queries and programs.
By resorting to standard unification,
non-ground queries on ground programs can be easily managed.
In future work we intend however to extend the procedure to non-ground programs without requiring preliminary program grounding. This should be made possible
by the tabling mechanism, which stores ground positive and negative intermediate results,
and by Relevance and Modularity of resource-based answer set semantics.

An important issue is whether RAS-XSB-resolution might be extended to plain ASP.
Unfortunately, ASP programs may have a quite complicated structure: the effort of \cite{ebserGMS09} has been, in fact, that
of performing a layer-based computation upon some conditions.
Many answer set programs concerning real applications are however
already expressed with constraints at the top layer, as required by our approach.

A comparison with existing proof procedures can be only partial, as these
procedures cope with any answer set program, with its involved internal structure.
So, overall our procedure imposes less 'a priori' conditions and has a simple definition, but
this is obtained by means of a strong preliminary assumption about constraints. However, as the expressive
power and complexity remain the same, our approach might constitute a
way of simplifying implementation aspects without significant losses
in \as practical'' expressivity.

We intend to investigate an integration of RAS-XSB-resolution
with principles and techniques introduced in \cite{BonattiPS08}, so as to further enlarge its applicability
to what they call \emph{finitary programs}, which are a large class of non-ground programs
with function symbols. In fact, this approach allows programmers to make use of popular
recursive definitions which are common in Prolog, and makes ASP technology even more
competitive with respect to other state-of-the-art techniques.

In summary, we have proposed the theoretical foundations of a proof procedure
related to a reasonable extension of answer set programming. The procedure has been obtained by taking as a basis XSB-resolution and its
tabling features.
Future work includes a precise design of a RAS-XSB-resolution implementation. Our objective is to realize an efficient inference engine, that should then be checked and experimented
on (suitable versions of) well-established benchmarks (see, e.g., \cite{DBLP:journals/ai/CalimeriGMR16}).
We intend in this sense to seek an integration with XSB, and with well-established ASP-related systems
(cf.~the discussion in \cite{GiunchigliaLM08}), already used for the implementation of the procedure proposed in \cite{BonattiPS08}.

\paragraph*{Acknowledgments}
The authors wish to thank the anonymous reviewers for their insightful comments.

redpajama_set_name: RedPajamaArXiv


Because this woman believes personal stories can stem the tide of anti-immigrant sentiment in Germany.
Kübra Gümüşay was 21 when she got her first death threat. As a German Muslim journalist writing about Islamophobia and sexism, she has learned that harassment comes with the job.
A European firestorm has been brewing in recent years over Muslim immigration in countries like France and Germany, where some feel that Muslim immigrants refuse to integrate into their adopted nations' societies. Some say they emphasize their differences in public too much — hijab-wearing women especially — and tax the social systems more than non-immigrants.
I suddenly was expected to defend my religion and the millions of people who practice it.
The daughter of Turkish immigrants, Kübra is Germany's first hijab-wearing columnist, and she's looking to stem the tide of anti-immigrant sentiment by challenging misconceptions. She writes for several publications like Die Zeit, Die Tageszeitung (Taz) and Der Freitag and has become a leading voice for a young generation of Turkish Germans determined to challenge social stereotypes.
This is no easy task in a country where racism is particularly strong against Turkish immigrants, who make up Germany's largest ethnic minority — about 2.7 million strong. Just over a third of Germans reportedly support prohibiting the immigration of Muslims, and the rate of unemployment among Germans of immigrant descent is higher than those with non-immigrant backgrounds — 5.6 percent versus 3.1 percent.
Kübra also wants to help others express themselves and has launched a social media campaign on Twitter under the hashtag #SchauHin for Germans to discuss the racism they encounter on a daily basis.
I would read the newspaper or political magazines and think … Nobody is telling my story.
It's been four years since Kübra received that first death threat — from a racist who wanted to explain why he was more German than she, along with details on how he would like to kill her. Sitting in a coffee shop in Oxford, England — where she currently lives — the 25-year-old reflects on how the experience highlights the power of storytelling.
"After I published a story about my wedding, he wrote again, saying he realized I was 'just another human being,'" Kübra says. "The man ended up apologizing!" she adds with a satisfied smile.
This is exactly the message Kübra hopes to share with others. By telling stories about everyday life, she's aiming to break down the stereotypes of migrants, women and Muslims. If others can relate to the stories, the walls of discrimination will fall, she believes.
Refusing to stay silent, Kübra joined the board of Young Journalists Association in Hamburg at age 16 and soon became the editor of youth magazine Freihafen.
In 2008, she launched her blog, "A Dictionary of Foreign Words," and started working for several newspapers and magazines. Three years later, she was offered her dream job: writing a biweekly column called "Das Tuch" (The Cloth) in the daily newspaper Die Tageszeitung.
Kübra's stories focus on her personal interactions with people, whether it's a transvestite in Turkey or a friend in Germany. What she's found is that stereotypes run rampant, and her perspectives are filling a void in German media.
Her message is also resonating with fellow Turkish immigrants, whether they're Muslim, religious or not. "What I really like about Kübra is her eloquent way of writing and talking about day-to-day discrimination of immigrants, women and Muslims," says Shebnem Klink-Zeren, a second-generation German of Turkish descent.
From a journalistic point of view, Kübra's articles are far from objective, but she believes remaining neutral is impossible. "The world you see is your world," she argues. "A room changes the moment you walk into it." Her biased but honest pieces have made her a popular media presence, and she's become a familiar face on television shows including Maybritt Illner and Bauerfeind and conferences like Re:Publica and TED.
As a public voice, Kübra opens herself to plenty of criticism. Some have gone so far as to accuse her of playing the victim, like Thilo Sarrazin, a politician and author of Germany Is Doing Away With Itself. "If you wear a head scarf, you should not be surprised if you are regarded by your environment as something separate. It's your choice," he said to her during a BBC radio debate in 2011.
In January, she was named Ambassador for Equality by Germany's Anti-Discrimination Agency, and her next objective is to take the #SchauHin campaign to the masses by organizing "salons" where people can share their views. She then hopes to compile a book of people's accounts.
Prejudices run deep, but Kübra's refreshing tone and determination might be what it takes to cut through the noise and advance the discourse on race, religion and gender in Germany.


text:
Superintendent candidates use opposing strategies
The two candidates for superintendent of public instruction are employing vastly different campaign strategies as they set their sights on November.
In her role as challenger, Democratic nominee Cindy Wilson is on the road eight days out of every 10, running up the miles on her car, taking meetings with most anyone, accepting debate invitations and running a robust social media and online campaign.
Republican incumbent Sherri Ybarra has promised that she's not a typical politician and won't behave as one. She has been keeping a low profile, and said she will prioritize her day job as state superintendent.
Last week, Wilson was on the campaign trail in McCall and Moscow. This week, it's off to Blaine and Teton counties.
Last week, Ybarra was at the Land Board and in meetings with Gov. Butch Otter and Senate President Pro Tem Brent Hill. Ybarra has no campaign events scheduled until Oct. 5.
Wilson's campaign strategy is to meet with anybody, accept any debate and interview invitation and ask every Idahoan she meets what is going right in their schools and what needs improving. Through Wilson's campaign website, anybody can request a meeting or schedule a house party or speaking appearance. Wilson said she'll even agree to one-on-one meetings.
"Having that discussion back and forth about what matters to people in their community is extremely important," Wilson said. "I always ask 'what kind of customer service do you want out of the State Department of Education?'"
Check out our watchdog work »
After winning the May primary, Wilson retired from her job as a social studies and political science teacher.
"What I knew and what I used to teach is No. 1, the incumbent always has the advantage and No. 2 the dominant political party always has an advantage in the campaign," Wilson said.
Advantage Ybarra.
Sherri Ybarra
Debate and campaign schedule
Ybarra and Wilson squared off during an Idaho Association of School Administrators candidate forum this month.
Ybarra has committed to participate in one other debate, while turning down at least two others.
Both Ybarra's team and Wilson's have confirmed they will participate in an Oct. 12 "Idaho Debates" forum to be broadcast on Idaho Public Television.
Beyond that, it's not clear if any other debates will materialize.
Ybarra declined an invitation from the Idaho Falls City Club to participate in a candidate debate. Wilson accepted that invitation. Ybarra also declined to commit to a Oct. 9 debate hosted by Idaho Education News.
"We invited Sherri Ybarra, but her staff indicated that her calendar was full and could not find any dates before Election Day to join us," said David Adler, vice president of the Idaho Falls City Club's board of directors.
Ybarra's official SDE work schedule often has open days — there are two this week (Wednesday and Friday).
Ybarra only lists one upcoming campaign event — an Oct. 5 meet and greet at an Eagle dive bar.
"Right now, Superintendent Ybarra is focused on supporting Idaho schools as they start the new school year," said CheRee Eveland, a local event and party planner working with Ybarra's campaign. "When events are scheduled or take place, we will post them on our Facebook page. We look forward to seeing you all over the state."
Idaho Education News has sent Ybarra and her campaign five requests to participate in a candidate forum scheduled for Oct 9. Ybarra and her campaign team never answered those invitations.
Wilson accepted the EdNews invitation and expressed disappointment that Ybarra didn't agree to the Idaho Falls and Idaho EdNews debates.
"I think the more we have the candidate exchange ideas and sharing goals for the State Department of Education, I think the better it is for public."
Ybarra's campaign website is static and lists no campaign events or updates.
Ybarra has 20 followers on her Facebook page, compared to Wilson's 1,342. Wilson also has 760 followers on Twitter, while Ybarra does not appear to have a presence there.
Wilson has also raised significantly more money for her campaign than Ybarra. Heading into the general election, Wilson had almost $37,000 in her campaign war chest, compared to Ybarra's $6,200.
Familiar territory for Ybarra
A low-key approach is nothing new to Ybarra, whose campaign did not respond to interview requests for this article.
In 2014, she was outspent and suffered several campaign gaffes and still went on to win a crowded Republican primary and a close general election that year.
"I obviously think Sherri has done a really good job as superintendent and think she's going to win re-election," said Frank Terraferma, executive director of the Idaho Republican Party.
Terraferma conceded that May's primary elections, especially higher up the ticket, were somewhat divisive. But he said the state's dominant political party is consolidating support behind the slate of GOP candidates.
Terraferma didn't have any specific debate or townhall appearances to promote for Ybarra, but said "I'm sure there will be debates with all media outlets, for the governor and probably on down."
Looking ahead, Terraferma said the GOP is gearing up for its traditional election year barnstorming bus tour with statewide candidates. The GOP hasn't released specifics dates or participants for the bus tour, but Terraferma said details will be unveiled as the events get closer.
Little aide: Spring reading scores provide a promising 'baseline'
Greg Wilson, Gov. Brad Little's education adviser, pointed to one specific spring score: 73.5 percent of third-graders were reading at grade level.


Order your favorite King's NY Pizza menu items online!
Our online ordering system is easy and convenient. Order any of your favorite menu items from appetizers, salads, subs, pastas and entrees to pizzas calzones, desserts and even lunch specials! We also offer smartphone ordering for mobile devices. You can pick up your order at our restaurant or have it delivered to you.


Come warm yourself with good dancing and community cheer this Saturday, February 8, from 8-11 pm. Expect a lovely evening of contras, squares, and circle dances to live music by the Gretchen & The F-Holes with calling by Andrea Nettleton.
Andrea Nettleton is a new caller who is making a name for herself at dances throughout the region including Atlanta, Chattanooga and River Falls.
Visit our event page for information about upcoming dances.


Members of the Pentecostal Dialogue teams have attempted to understand themselves as a conversionist, revivalist, and restorationist movement.
Here, enumerated in no particular order, are a few important findings relevant to Pentecostal ecumenical prospects in particular and for developments in and for Pentecostal theology more generally. First, explorations in theological method in this project are a posteriori, dependent on analysis of the actual dialogues as they occurred, and demonstrate how methodological approaches are embedded within and manifest through dialogical engagement on the one hand even as they reflect theological instincts and habits on the other hand; put another way, even if in the theological academy there is a tendency to come clean with one's methodological orientation up front, in reality, it is probably truer to say that such segments are written as much in hindsight (of writing the book, etc.) as they are presuppositions brought into the project. Second, the methodological frame delineated in this case study (which is actually a set of cases: five rounds of cases to be more exact) was forged dialogically (with Roman Catholic interlocutors, more precisely) in and through pragmatic strategies of honestly bringing forth perceived hard questions to the conversation (which Creemers notes that in comparative context did not work well in other bilateral dialogues!); as such theological methodologies discerned post facto are inevitably contextually constrained if not determined and this is something to be borne in mind rather than to be regretted as then not allowing access to any putatively global or universal methodological key (which aspirations for reflect more habits of Enlightenment thinking than they do actual consideration of how our epistemic and procedural practices are historically informed). Third, and as an extension of the previous point, methodological character is not only contextually situated but teleologically guided, even compelled; what I am referring to is how not only mutual consideration of the sources within the Christian tradition (preferred by the Roman Catholic dialogue team) made their presence increasingly palpable as joint undertakings (emerging most fully during the fifth round), but also to how focused efforts on pastoral challenges related to mission, evangelism, proselytism, and ecclesial practice foregrounded certain resources derived from socio-historical and other modes of shedding light on the real issues while foreclosing other pathways.
… coming to grips with the role of experience in the theological task.
Last and most importantly for reflection on the interrelationship between method and theology is that the Pentecostal team could not be forged, nor its commitments adequately represented, apart from a presumably shared spirituality and praxis, one which operated as much if not more on the practical and affective levels as at the cognitive dimension. This meant both that experience (of the Holy Spirit, specifically!) became central to these dialogues in ways remarkably distinguished from what happens at bilateral conversations more generally (which work often, sometimes exclusively, on received dogmatic documents), and that the Roman Catholic conversation partners were also invited – forced may be too strong a description – to come to grips with the role of experience in their own theological efforts. With experience being bedrock to the Pentecostal theological task, the normative role of scripture (even tradition) was, and is, not compromised but such was complicated indeed. Pentecostal theologians will come away from this volume with additional fodder for construing pentecostal spirituality, in all of its experiential and historical diversity, as central to their ongoing theological work, as has generally been the trend so far.


text:
EPPO Reporting Service no. 05 - 2010 Num. article: 2010/096
Eradication of Xanthomonas fragariae in the United Kingdom
Xanthomonas fragariae (EPPO A2 List) was detected for the first time in the United Kingdom in 2004. A grower in the South-East of England had contacted the NPPO in October 2004 after observing suspect symptoms in a strawberry crop (Fragaria ananassa cv. 'Elsanta') some weeks after harvest had finished. Plant samples were collected and were found to be infected by X. fragariae. Following this initial identification, further inspections of other crops at the infected farm were undertaken. These revealed infection in two additional fields on either side of the original Elsanta crop. Tracing-back studies showed that the infected plants had been imported from the Netherlands in May 2004. On arrival the infected lot of Elsanta had been split between 4 farms. The other 3 farms were located in the South-East of England, in South-West England and in Scotland. Crops on these farms were inspected for symptoms and samples were taken for testing. Symptoms of X. fragariae were observed at the second site in South-East England. No visual symptoms were observed in South-West England or Scotland, but following testing the presence of X. fragariae was suspected at the site in Scotland. The infected plants in Scotland were all destroyed voluntarily by the grower prior to completion of testing. There was no evidence of infection at the site in South-West England, further inspections and testing were carried out throughout 2005 but infection was not confirmed and the crop was destroyed at the end of its fruit bearing season in 2005. At both infected sites in South-East England, official control measures were taken. Growers did not destroy all plants immediately but chose to maintain their crops until harvest with strict hygiene measures to prevent any further spread. Strawberry crops grown on these farms continued to be monitored during the following growing seasons and X. fragariae was no longer found. It is considered that X. fragariae has been eradicated from the United Kingdom.
The situation of Xanthomonas fragariae in the United Kingdom can be described as follows: Absent, detected for the first time in 2004 in 3 productions sites (2 in South-East England and 1 in Scotland), eradicated.
Matthews-Berry SS, Reed PJ (2009) Eradication of the first outbreak of Xanthomonas fragariae in the United Kingdom. Bulletin OEPP/EPPO Bulletin 39(2), 171-174.


Commercial Air Conditioning and Special Projects in Brisbane.
Servicing Brisbane for over 15 years.
Solution focused design, installation and services of all Air Conditioning Systems.
Professional design, installation and maintenance of commercial and residential air conditioning system.
For over 15 years, Ascot Air Special Projects has been providing exceptional air conditioning services to businesses and residences in South East Queensland. Our team is highly experienced in designing and delivering projects ranging from luxury homes to shopping centres, corporate high-rises and universities.
Our in-house Incorporated Engineer, Draftsman and Project Managers work closely with our clients to deliver reliable and effective solutions for even the most complex projects.
View our full capabilities. View Quality Policy.