1 - 5 of 5 articles
An enhanced concept of sub-optimal reverse Horn fraction of a CNF-formula was introduced in . It was shown that this fraction is very useful in effectively (almost) separating 3-colorable random graphs with fixed node-edge density from the non-3-colorable ones. A correlation between this...
In this paper, we establish a formal semantics for Pollock’s  theory of defeasible reasoning. As a notion of argument or argumentation has never been formalised in this theory, it is important that such a formal account be introduced to couple with the algorithmic description of the theory....
In this paper we consider constraint satisfaction problems where the set of constraint relations is fixed. Feder and Vardi (1998) identified three families of constraint satisfaction problems containing all known polynomially solvable problems. We introduce a new class of problems called...
In many applications of knowledge-based systems, initially given data are often not sufficient to reach a conclusion and more data are needed. A question-selection algorithm is to identify missing information and select proper questions to ask. We present a question-selection algorithm for...
Sequent calculi for skeptical consequence in predicate default logic, predicate stable model logic programming, and infinite autoepistemic theories are presented and proved sound and complete. While skeptical consequence is decidable in the finite propositional case of all three formalisms, the...
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Sign Up Log In
To subscribe to email alerts, please log in first, or sign up for a DeepDyve account if you don’t already have one.
To get new article updates from a journal on your personalized homepage, please log in first, or sign up for a DeepDyve account if you don’t already have one.