Infinitesimal
发表于 2025-3-25 04:02:08
http://reply.papertrans.cn/39/3802/380194/380194_21.png
债务
发表于 2025-3-25 10:29:18
A new sorted logic,t compared to deductions in the unsorted resolution calculus. The approach is a conservative extension of the known sorted approaches, as it simplifies to the known sorted calculi if we apply the calculus to the much more restricted input formulas of these calculi.
addition
发表于 2025-3-25 13:34:10
Efficient computation of solutions for contradictory time interval networks,r-defined assumptions..In this paper, a basic algorithm for computing elementary solutions is presented, and for reasons of efficiency a modification of this algorithm is explained. In this way, we get an efficient computation of elementary solutions for contradictory time interval networks.
amputation
发表于 2025-3-25 16:02:43
Extensions of concept languages for a mechanical engineering application,t subsumption problem is undecidable. It should be noted that the need for these extensions is not particular to the considered problem domain; similar representation demands are likely to occur in other non-toy applications.
迁移
发表于 2025-3-25 20:08:43
Concept support as a method for programming neural networks with symbolic knowledge,s believed to be essential for the task. Thus the knowledge actually accessible for the neural network remains distributed or -as it is called-subsymbolic. Results from a test application are reported which show considerable improvements in generalization.
纹章
发表于 2025-3-26 01:04:17
Learning plan abstractions,odology is applied to learn from machine-oriented programs. An abstract program can be acquired on a higher programming level which is characterized through the use of abstract data types instead of machine-oriented data representations.
名字
发表于 2025-3-26 07:55:53
https://doi.org/10.1007/978-3-030-32142-0code area into a backward and forward code area and by adding a new stack to record derived facts. This shows how an efficient implementation of meta-interpreters can have an effect on compilation and even on the design of the target machine.
农学
发表于 2025-3-26 10:05:35
http://reply.papertrans.cn/39/3802/380194/380194_28.png
senile-dementia
发表于 2025-3-26 16:23:53
https://doi.org/10.1007/BFb0018988Distributed AI Systems; Knowledge Representation; Logic Programming; Machine Learning; Natürlichsprachli
Congregate
发表于 2025-3-26 20:48:14
Laws, Levels of Descriptions, and Models,oleinized formula is first transformed into a Shannon graph, then the latter is compiled into a set of Horn clauses. These can finally be run as a Prolog program trying to refute the initial formula. It is also possible to precompile axiomatizations into Prolog and load these theories as required.