The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Filters
A Hierarchy of Tractable Subsets for Computing Stable Models
[article]
1996
arXiv
pre-print
Preserved Fulltext
Finding the stable models of a knowledge base is a significant computational problem in artificial intelligence. ...
base Pi is in Omega_k, then Pi has at most k stable models, and all of them may be found in time O(lnk), where l is the length of the knowledge base and n the number of atoms in Pi; third, for an arbitrary ...
Acknowledgments Thanks to Luigi Palopoli for useful comments on earlier draft of this paper and to Michelle Bonnice and Gadi Dechter for editing on parts of the manuscript. ...
arXiv:cs/9608104v1
fatcat:gngh5qss7bdrncjpjye7rcuhyq
A Hierarchy of Tractable Subsets for Computing Stable Models
1996
The Journal of Artificial Intelligence Research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Finding the stable models of a knowledge base is a significant computational problem in artificial intelligence. ...
base Pi is in Omega_k, then Pi has at most k stable models, and all of them may be found in time O(lnk), where l is the length of the knowledge base and n the number of atoms in Pi; third, for an arbitrary ...
Acknowledgments Thanks to Luigi Palopoli for useful comments on earlier draft of this paper and to Michelle Bonnice and Gadi Dechter for editing on parts of the manuscript. ...
doi:10.1613/jair.223
fatcat:irlkczytsjhfdcslz724bkkg6q
Computational Resource Demands of a Predictive Bayesian Brain
2019
Computational Brain & Behavior
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Given that many forms of cognition seem to be well characterized as a form of Bayesian inference, this conjecture has great import for cognitive science. ...
It suggests that predictive processing may provide a neurally plausible account of how forms of cognition that are modeled as Bayesian inference may be physically implemented in the brain. ...
This research was funded by a NWO-TOP grant (407-11-040) awarded to IvR; NWO had no involvement in study design, collection, analysis and interpretation of data, in the writing of the report, or in the ...
doi:10.1007/s42113-019-00032-3
fatcat:vvadybxrdrc6hedkn6hn7gzvoe
Fixed-Parameter Algorithms For Artificial Intelligence, Constraint Satisfaction and Database Problems
2007
Computer journal
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
Furthermore, we survey parameterized algorithms for problems arising in the context of the stable model semantics of logic programs, for a number of other problems of non-monotonic reasoning, and for the ...
computation of cores in data exchange. ...
Acknowledgment We thank Mike Fellows for valuable comments on a preliminary version of the paper and Marko Samer for careful proof reading. ...
doi:10.1093/comjnl/bxm056
fatcat:okmgxlprfjfdtl5sienm6b5vdu
Page 7804 of Mathematical Reviews Vol. , Issue 97M
[page]
1997
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
In this paper, a characterization of partial stable models for disjunctive datalog programs is given using a suitable extension of the notion of unfounded set. ...
On the one hand, L-stable models are shown to be the natural re- laxation of the notion of total stable model; on the other hand the less strict M-stable models, endowed with a nice modularity prop- erty ...
A survey of complexity results for non-monotonic logics
1993
The Journal of Logic Programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We not only give results about the tractability/intractability of the individual problems but we also analyze sources of complexity and explain intuitively the nature of easy/hard cases. ...
This paper surveys the main results appearing in the literature on the computational complexity of non-monotonic inference tasks. ...
Furthermore, each subclass of 2-default theories that translates into a tractable subclass of propositional satisfiability is a tractable subset of default logic. ...
doi:10.1016/0743-1066(93)90029-g
fatcat:iewbxiclhbbwzeayv6esr2c5ei
Fixed-Parameter Complexity in AI and Nonmonotonic Reasoning
[chapter]
1999
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
programming under the stable model semantics where the parameter is the dimension of a feedback vertex set of the program's dependency graph, and circumscriptive inference from a positive k-CNF restricted ...
to models of bounded size. ...
Part of the work of Francesco Scarcello has been carried out while visiting the Technische Universität Wien. ...
doi:10.1007/3-540-46767-x_1
fatcat:tui4rdaidrh6rjcvi6ybqaibgq
Fixed-parameter complexity in AI and nonmonotonic reasoning
2002
Artificial Intelligence
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
programming under the stable model semantics where the parameter is the dimension of a feedback vertex set of the program's dependency graph, and circumscriptive inference from a positive k-CNF restricted ...
to models of bounded size. ...
Part of the work of Francesco Scarcello has been carried out while visiting the Technische Universität Wien. ...
doi:10.1016/s0004-3702(02)00182-0
fatcat:vrfcg23nyjettjkvt2y3nne4ky
Computing large and small stable models
[article]
2000
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Other Versions
We show that for every fixed integer k, there is a linear-time algorithm to decide the problem LSM (large stable models problem): does a logic program P have a stable model of size at least |P|-k. ...
In this paper, we focus on the problem of existence and computing of small and large stable models. ...
Acknowledgments The author thanks Victor Marek and Jennifer Seitzer for useful discussions and comments. The author is grateful to anonymous referees for very careful reading of the manuscript. ...
arXiv:cs/0002001v2
fatcat:rqiloqs6obamho2qql7pdqwvpy
The Parameterized Complexity of Constraint Satisfaction and Reasoning
[chapter]
2013
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Parameterized Complexity is a new and increasingly popular theoretical framework for the rigorous analysis of NP-hard problems and the development of algorithms for their solution. ...
The framework provides adequate concepts for taking structural aspects of problem instances into account. ...
deciding whether an atom belongs to some stable model or whether it belongs to all stable models). ...
doi:10.1007/978-3-642-41524-1_2
fatcat:ee2md36scbckvne73x7qfkw5ra
A Hierarchy of Subgraph Projection-Based Semidefinite Relaxations for Some NP-Hard Graph Optimization Problems
2015
INFOR. Information systems and operational research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We propose a new hierarchy of semidefinite relaxations for classes of such problems that are based on graphs and for which the projection of the problem onto a subgraph shares the same structure as the ...
Preliminary computational results show that the proposed hierarchy yields improved bounds when compared to the initial relaxation for benchmark instances of the max-cut and stable-set problems, and that ...
Even though we have included the projection constraints for all subsets of cardinality k in these computations, a closer look at the computational results shows that in fact only a small fraction of these ...
doi:10.3138/infor.53.1.40
fatcat:pespvnzmnnecvha2v3eeducw6a
Page 5902 of Mathematical Reviews Vol. , Issue 98I
[page]
1998
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
A distributed decision strategy is presented.”
98i:68257 68T30
Ben-Eliyahu, Rachel |Ben-Eliyahu-Zohary, Rachel]
(IL-BGUN-CS; Be‘ér Sheva‘)
A hierarchy of tractable subsets for computing stable models. ...
Summary: “Finding the stable models of a knowledge base is a significant computational problem in artificial intelligence. ...
Limits of Preprocessing
[article]
2011
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Other Versions
Our results provide a firm theoretical boundary for the performance of polynomial-time preprocessing algorithms for the considered problems. ...
We present a first theoretical analysis of the power of polynomial-time preprocessing for important combinatorial problems from various areas in AI. ...
A fundamental computational problems is Stable Model Existence (SME), which asks whether a given normal logic program has a stable model. ...
arXiv:1104.5566v2
fatcat:vullevpcbvgr5jxgw4nz3l4q5m
Strong Backdoors for Default Logic
[article]
2016
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In this paper, we introduce a notion of backdoors to Reiter's propositional default logic and study structural properties of it. ...
We show that backdoor detection is fixed-parameter tractable for the considered target classes, and backdoor evaluation is either fixed-parameter tractable, in para-DP2 , or in para-NP, depending on the ...
He is also affiliated with the Institute of Computer Science and Computational Science at University of Potsdam, Germany. ...
arXiv:1602.06052v1
fatcat:czepd5rrfbfqri5rgjri7lcqp4
Augmenting tractable fragments of abstract argumentation
2012
Artificial Intelligence
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We present a new approach to the efficient solution of important computational problems that arise in the context of abstract argumentation. ...
Our approach makes known algorithms defined for restricted fragments generally applicable, at a computational cost that scales with the distance from the fragment. ...
Acknowledgements We thank the anonymous reviewers for their valuable suggestions that helped to improve the presentation of the paper. ...
doi:10.1016/j.artint.2012.03.002
fatcat:zi5kasv7ufej3cxgxswvjkrk4i
« Previous
Showing results 1 — 15 out of 6,278 results