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.
Filters
Forthcoming papers
1997
Artificial Intelligence
Preserved Fulltext
This result can be applied to knowledge representation theory and corresponds, in revision theory, to Groves's family of spheres. ...
Freund, Preferential reasoning in the perspective of Poole default logic The sceptical inference relation associated with a Poole system without constraints is known to have a simple semantic representation ...
Tit&ham, Schema induction for logic program synthesis Prolog program synthesis can be made more efficient by using schemata which capture similarities in previously-seen programs. ...
doi:10.1016/s0004-3702(97)90001-1
fatcat:zcjn5iiajrfzxov5eqjyac34s4
Index—Volumes 1–89
1997
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.
286
of world models 43
techniques 47
constructive
problem-solving
342
problems 563
situations 189
consultant, program as a -93
consultation by computer 446
consultation program
for medical ...
methods 933 planner 668 priorities in -1287 problem solving 1018 problems 1245 problems, fundamental -602 programs 679 programs, large _ 178 research 545 research, classical -604 robotics challenge to ...
112, 147,245,292,296, 303,444,453, 461,503,573,632,690,692, 1079, 1204, 1222,1339 reasoning abductive -684, 1175, 1222 logical -1124, 1217 machinery 58 1 management of evidential -328 mathematical -166,579 ...
doi:10.1016/s0004-3702(97)80122-1
fatcat:6az7xycuifaerl7kmv7l3x6rpm
Meta-reasoning: A Survey
[chapter]
2002
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.
After a discussion of the seminal approaches, we outline our own perception of the state of the art, mainly but not only in computational logic and logic programming. ...
Research about meta-reasoning and reflection in computer science has its roots in principles and techniques developed in logic, since the fundamental work of Gödel and Tarski, for which it may be useful ...
In the logic programming framework it comes natural to recognize the higher-order nature of timedependent propositions and to try to represent them at the meta-level. ...
doi:10.1007/3-540-45632-5_11
fatcat:dahl7nw67vanzjeys2cgofurau
Formalization as the Immanent Part of Logical Solving
2018
Logical Investigations
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.
The work is devoted to the logical analysis of the problem solving by logical means. ...
The precise solving of a precisely stated logical problem occupies only one third of the whole process of solving real problems by logical means. ...
logics during problem solving. ...
doi:10.21146/2074-1472-2018-24-1-129-145
fatcat:ifgxfvssgze5zoibim7sruqnxi
Formal verification of a generic framework to synthesize SAT-provers
2004
Journal of automated reasoning
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 2013; you can also visit the original URL.
The file type is application/pdf.
We present in this paper an application of the ACL2 system to generate and reason about propositional satisfiability provers. ...
For that purpose, we develop a framework where we define a generic SAT-prover based on transformation rules, and we formalize this generic framework in the ACL2 logic, carrying out a formal proof of its ...
A more recent work is done by Caldwell [4] using Nuprl and program extraction to obtain a mechanically verified sequent proof system for propositional logic. ...
doi:10.1007/bf03177742
fatcat:kw6a66uco5faxntunbwxprzgpa
COMPUTATIONAL LOGICS AND AGENTS: A ROAD MAP OF CURRENT TECHNOLOGIES AND FUTURE TRENDS
2007
Computational 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 2007; you can also visit the original URL.
The file type is application/pdf.
Such a logical basis not only presents the clarity and consistency required but also allows for important techniques such as logical verification to be applied. ...
Even though, with such a rapidly changing field, it is impossible to cover every development, we aim to give the reader sufficient background to understand the current research problems and potential future ...
logic-based verification techniques. ...
doi:10.1111/j.1467-8640.2007.00295.x
fatcat:c76gbfuuwngjpk7ebs2jkpfxfi
On conceptual structures
1988
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 2016; you can also visit the original URL.
The file type is application/pdf.
There are many surveys of AI in print, and a handful of volumes on programming techniques, but very few theoretically rich textbooks. Sowa has managed to produce one. ...
conceptual dependency theory, KL-ONE, and KRYPTON; procedural attachments for relating the propositional graphs to computational mechanisms; the use of schemata for handling script-like and frame-like ...
doi:10.1016/0004-3702(88)90069-0
fatcat:r6iziq6tjrht7p2tj2fepwj7fa
MICSL: Multiple Iterative Constraint Satisfaction based Learning
1999
Intelligent Data Analysis
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.
The algorithm utilizes mathematical programming and constraint satisfaction techniques towards uniform representation and management of both data and background knowledge. ...
The representation flexibility of MICSL rests on a method that transforms propositional cases, represented as propositional clauses, into constraint equivalents. ...
Successful constraint satisfaction techniques are mostly utilized in the constraint logic programming (CLP) context. ...
doi:10.1016/s1088-467x(99)00022-0
fatcat:wrv3vrww7fgt5dnugdlh4ynmvu
Inductive Logic Programming: Theory and methods
1994
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.
They would also like to thank the reviewers for their constructive comments and suggestions. ...
The authors would especially like to thank Maurice Bruynooghe of the Katholieke Universiteit Leuven and Lincoln Wallen of Oxford University Computing Laboratory for useful input during this research. ...
One problem in which this is obvious is the domain of logic program synthesis from examples. Most logic programs cannot be defined using only propositional logic. ...
doi:10.1016/0743-1066(94)90035-3
fatcat:v2trhpjg7jglxcstjpooffzaey
A model for the interpretation of verbal predictions
1984
International Journal of Man-Machine Studies
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.
There is a marked gap between the demands on forecasting and the results that numerical forecasting techniques usually can provide. ...
The applicability of this model is demonstrated in a study where bank clerks had to predict exchange rates. ...
I want to thank the other contributors for many valuable suggestions made in the discussion. ...
doi:10.1016/s0020-7373(84)80009-7
fatcat:cp2fdrxe4jgmdep5zfc5co6rji
Page 1099 of Psychological Abstracts Vol. 71, Issue 4
[page]
1984
Psychological Abstracts
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
. — formal operational tasks to 59 2nd-yr medical students to examine their abilities to solve problems in 4 formal logical schemata: combinatorial logic, probabilistic reasoning, propositional logic, ...
As feedback to the program, it provides important information about goals, policies, values, and rules. (6 ref)
10479. Hale, James P. ...
On Complexity of Optimal Recombination for Binary Representations of Solutions
2008
Evolutionary Computation
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.
Also we identify several NP-hard cases of optimal recombination: the Boolean linear programming problems with three variables per inequality, the knapsack, the set covering, the p-median and some other ...
of the optimal recombination problems (ORPs) we show the polynomial solvability of the ORPs for the maximum weight set packing problem, the minimum weight set partition problem and the linear Boolean programming ...
Thus, by Proposition 3 the ORP reduces to solving the maximum weight independent set problem in a bipartite graph H , which is solvable in O(d 3 ) operations (see e.g. the proof of Proposition 1). ...
doi:10.1162/evco.2008.16.1.127
pmid:18386998
fatcat:4yfb5yf26bffvbb32zxtjzuff4
FluCaP: A Heuristic Search Planner for First-Order MDPs
2006
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.
Other Versions
We demonstrate the usefulness of the above techniques for solving FOMDPs with a system, referred to as FluCaP (formerly, FCPlanner), that entered the probabilistic track of the 2004 International Planning ...
We present a heuristic search algorithm for solving first-order Markov Decision Processes (FOMDPs). ...
His valuable comments have helped us to improve this paper. ...
doi:10.1613/jair.1965
fatcat:3wu5syw7yve2lgq5dxyx3ytpaq
Splitting Computation of Answer Set Program and Its Application on E-service
2011
International Journal of Computational Intelligence Systems
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.
Based on the stable model semantics of logic programming, ASP can be used to solve various combinatorial search problems by finding the answer sets of logic programs which declaratively describe the problems ...
It's not an easy task to compute answer sets of a logic program using Gelfond and Lifschitz's definition directly. ...
Acknowledgements We want to thank the anonymous reviewers for their helpful comments on an earlier version of this paper. This work is supported by the Natural Science ...
doi:10.1080/18756891.2011.9727846
fatcat:g3nttaorkvhajilwxqm65r4ls4
Ensuring Trustworthy and Ethical Behavior in Intelligent Logical Agents
2020
Italian Conference on Computational Logic
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 2022; you can also visit the original URL.
The file type is application/pdf.
These techniques are able to certify 'a priori' that agents ...
We restrict ourselves to agent systems based upon computational logic, because they provide transparency and explainability 'by design', as logical rules can easily be transposed into natural-language ...
logical consequences of agent program P i : Definition 2. ...
dblp:conf/cilc/Costantini20
fatcat:3p7udolle5fpbh3aq24vlmzkqy
« Previous
Showing results 1 — 15 out of 1,865 results