Results 1 to 10 of about 1,498,950 (288)
Chemically Programmable Underwater Sound-Absorbing Metamaterial via MXene Self-Assembly. [PDF]
MXene self‐assembly creates a chemically programmable underwater metamaterial with quasi‐periodic layers and a chemical‐physical multi‐level constraint system. A crosslinker as a ‘chemical scissor’ precisely edits microscopic interactions, exciting deep‐subwavelength strong local resonances that induce near‐zero/negative effective bulk modulus (Keff ...
Gan Z +5 more
europepmc +2 more sources
Learning R with generative AI in a metagenomic data science course. [PDF]
Blanchard JL.
europepmc +1 more source
Some of the next articles are maybe not open access.
Logic programs as types for logic programs
[1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science, 2002Optimistic type systems for logic programs are considered. In such systems types are conservative approximations to the success set of the program predicates. The use of logic programs to describe types is proposed. It is argued that this approach unifies the denotational and operational approaches to descriptive type systems and is simpler and more ...
Thom W. Frühwirth +3 more
openaire +1 more source
Communications of the ACM, 1985
Logic programming is programming by description. The programmer describes the application area and lets the program choose specific operations. Logic programs are easier to create and enable machines to explain their results and actions.
Michael R. Genesereth +1 more
openaire +1 more source
Logic programming is programming by description. The programmer describes the application area and lets the program choose specific operations. Logic programs are easier to create and enable machines to explain their results and actions.
Michael R. Genesereth +1 more
openaire +1 more source
Fundamenta Informaticae, 1992
Starting from a general dynamic analysis of reasoning and programming, we develop two main dynamic perspectives upon logic programming. First, the standard fixed point semantics for Horn clause programs naturally supports imperative programming styles.
openaire +3 more sources
Starting from a general dynamic analysis of reasoning and programming, we develop two main dynamic perspectives upon logic programming. First, the standard fixed point semantics for Horn clause programs naturally supports imperative programming styles.
openaire +3 more sources
Hybrid Probabilistic Logic Programs as Residuated Logic Programs
Studia Logica, 2000zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Carlos Viegas Damásio +1 more
openaire +4 more sources
Logic Programming and Default Logic
International Journal on Artificial Intelligence Tools, 1994We present several ideas of increasing complexity how to translate default theories to normal logic programs that make direct use of the deductive capacity of logic programming. We show the limitations of simple, ad hoc approaches, and arrive at a more general construction; its main property is that the answer substitutions computed by the logic ...
openaire +2 more sources
Studia Logica, 1985
The paper is concerned with a relationship between programs and Gentzen type formalizations of predicate and propositional logics. It turns out that finite control algorithms (which serve as models of iterative programs) are sufficient for describing the proof searching procedures for propositional logics which admit cut-free Gentzen type formalization,
openaire +2 more sources
The paper is concerned with a relationship between programs and Gentzen type formalizations of predicate and propositional logics. It turns out that finite control algorithms (which serve as models of iterative programs) are sufficient for describing the proof searching procedures for propositional logics which admit cut-free Gentzen type formalization,
openaire +2 more sources
Differential logic programming
Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '93, 1993In this paper we define a compositional semantics for a generalized composition operator on logic programs. Static and dynamic inheritance as well as composition by union of clauses can all be obtained by specializing the general operator. The semantics is based on the notion of differential programs, logic programs annotated with declarations that ...
Annalisa Bossi +4 more
openaire +2 more sources
ACM Transactions on Programming Languages and Systems, 1994
Modularity is a key issue in the design of modern programming languages. When designing modular features for declarative languages in general, and for logic programming languages in particular, the challenge lies in avoiding the superimposition of a complex syntactic and semantic structure over the simple structure of the basic language.
BROGI, ANTONIO +3 more
openaire +2 more sources
Modularity is a key issue in the design of modern programming languages. When designing modular features for declarative languages in general, and for logic programming languages in particular, the challenge lies in avoiding the superimposition of a complex syntactic and semantic structure over the simple structure of the basic language.
BROGI, ANTONIO +3 more
openaire +2 more sources

