Re: Existence of proof verifiers: A comedy

Charlie-Boo schrieb:

What I am saying is that DataBase Query Processing IS a problem of
using Logic, as is Program Synthesis and even Theory of Computation.
They talk about the obvious role of AND, OR, NOT in queries, but never
exploited that. When you say it is off-topic. that is pointing out
that nobody came up with a general logical solution that uses
Predicate Calculus for the wff and Rules of Inference to reduce that
down to ANY file with any number of levels of hierarchy and any
logical expression at each level.

It seems that the deductive database/descriptive complexity
developments slipped your attention.

I am not saying that there is a wide base using
these approaches. But the approaches are already
there.

The problem is, that not so many exploits are possible
by logic. You can view FOL as a language, similar to
SQL. So when you change the language in the interface
to a database, this doesn't mean that you automatically
get a better execution.

What is done down in the execution, can be mostly
viewed as trading space for time. Thus when you have
an index, you are using more space, but you gain
some execution time.

What would be exactly the great gain by using FOL?

Best Regards
.

Relevant Pages

  • Re: COBOLs Influence on C
    ... Robert's reply seems to "assume" an IBM mainframe environment. ... learn of missing external names either at link or execution time. ... compilation and before execution. ...
    (comp.lang.cobol)
  • Cannot open a log file of specified name
    ... I have a DTS package called 'MASTER' which performs 8 execute DTS package ... The execution of the following DTS Package succeeded: ... Total Step Execution Time: 2.375 seconds ... Progress count in Step: 0 ...
    (microsoft.public.sqlserver.dts)
  • Re: Embedded Basic interpreter recommendations?
    ... Code size and execution time should be no problem, ... but the rest is important for interactive development on the target ... And do all of that in a relatively small part of the flash -- which, ...
    (comp.arch.embedded)
  • Re: flash and external ram timing on TI 2812
    ... Would someone be able to explain me how to calculate the execution time of ... One routine should configure the settings and timing for the ...
    (comp.dsp)
  • Re: Model control-flow graphs
    ... let's assume I know the execution time for each ... I'd like to find the longest path within my graph ... The maximal execution time is typically discovered using Integer Linear Programming applied to the extended CFG -- the Implicit Path Enumeration technique; see the survey for references. ... Niklas Holsti ...
    (comp.arch.embedded)