| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNINA9910661839903321 |
|
|
Autore |
Calosse Jp. A |
|
|
Titolo |
[Mega square] [[electronic resource] ] Love / / [Jp. A. Calosse] |
|
|
|
|
|
Pubbl/distr/stampa |
|
|
New York, : Parkstone Press International, [2011] |
|
|
|
|
|
|
|
ISBN |
|
1-283-95721-3 |
1-78042-229-6 |
|
|
|
|
|
|
|
|
Descrizione fisica |
|
1 online resource (256 p.) |
|
|
|
|
|
|
Collana |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
|
|
|
|
|
Nota di contenuto |
|
Foreword; Come! an Unseen Flute; The Gentle Heart; She Walks in Beauty; Katharine; Believe me...; The Unseen Power; He touched me, so I live to know; Ode to Cassandra; Somewhere There Waiteth; Meeting at Night; To the Distant One; To Laura at the Harpsichord; A Red, Red Rose; Love; Sonnet 18; Some Day; To Marie; To a Stranger; Woman's Constancy; Maiden with the lips of scarlet; To Celia; This Marriage; The First Day; My love has talk'd with rocks and trees; How do I love thee?; One Word Is Too Often Profaned; The Ragged Wood; To My Dear and Loving Husband; I Loved You; Dear Chains; To the moon |
Bright StarHymn to Aphrodite; To His Coy Mistress; Come Slowly; She Comes Not; Eulalie; Who Ever Felt as I; Come Fill the Cup; A Hemisphere in a Head of Hair; Beyond a mortal man impassion'd far; Love Not Me; It's all I have to bring to-day; List of Illustrations |
|
|
|
|
|
|
|
|
Sommario/riassunto |
|
A timeless theme that cannot be ignored, love has always fascinated artists. Painters, sculptors and even architects have drawn inspiration from and illustrated it. Ever new, love has led artists to create the masterworks of their life. From Titian's Sacred and Profane Love to Brancusi's The Kiss, the treatment of love has changed along with time and style, but remains, in the end, an everlasting universal language. This book illustrates love in all its strength and variety. |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2. |
Record Nr. |
UNISA996465968103316 |
|
|
Titolo |
Logic for Programming, Artificial Intelligence, and Reasoning [[electronic resource] ] : 11th International Workshop, LPAR 2004, Montevideo, Uruguay, March 14-18, 2005, Proceedings / / edited by Franz Baader, Andrei Voronkov |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
|
|
|
|
|
|
|
|
|
Edizione |
[1st ed. 2005.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (XII, 560 p.) |
|
|
|
|
|
|
Collana |
|
Lecture Notes in Artificial Intelligence ; ; 3452 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Software engineering |
Artificial intelligence |
Mathematical logic |
Computer logic |
Computer programming |
Software Engineering/Programming and Operating Systems |
Artificial Intelligence |
Mathematical Logic and Formal Languages |
Logics and Meanings of Programs |
Software Engineering |
Programming Techniques |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Bibliographic Level Mode of Issuance: Monograph |
|
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographical references and index. |
|
|
|
|
|
|
Nota di contenuto |
|
CERES in Many-Valued Logics -- A Decomposition Rule for Decision Procedures by Resolution-Based Calculi -- Abstract DPLL and Abstract DPLL Modulo Theories -- Combining Lists with Non-stably Infinite Theories -- Abstract Model Generation for Preprocessing Clause Sets -- Flat and One-Variable Clauses: Complexity of Verifying Cryptographic Protocols with Single Blind Copying -- Applications of General Exact Satisfiability in Propositional Logic Modelling -- BCiC: A System for Code Authentication and Verification -- Ordered Resolution with Selection for -- On a Semantic Subsumption Test -- Suitable Graphs for Answer Set Programming -- Weighted Answer Sets and |
|
|
|
|
|
|
|
|
|
|
Applications in Intelligence Analysis -- How to Fix It: Using Fixpoints in Different Contexts -- Reasoning About Systems with Transition Fairness -- Entanglement – A Measure for the Complexity of Directed Graphs with Applications to Logic and Games -- How the Location of * Influences Complexity in Kleene Algebra with Tests -- The Equational Theory of ??, 0, 1,?+?, ×, ?? Is Decidable, but Not Finitely Axiomatisable -- A Trichotomy in the Complexity of Propositional Circumscription -- Exploiting Fixable, Removable, and Implied Values in Constraint Satisfaction Problems -- Evaluating QBFs via Symbolic Skolemization -- The Dependency Pair Framework: Combining Techniques for Automated Termination Proofs -- Automated Termination Analysis for Incompletely Defined Programs -- Automatic Certification of Heap Consumption -- A Formalization of Off-Line Guessing for Security Protocol Analysis -- Abstraction-Carrying Code -- A Verification Environment for Sequential Imperative Programs in Isabelle/HOL -- Can a Higher-Order and a First-Order Theorem Prover Cooperate? -- A Generic Framework for Interprocedural Analyses of Numerical Properties -- Second-Order Matching via Explicit Substitutions -- Knowledge-Based Synthesis of Distributed Systems Using Event Structures -- The Inverse Method for the Logic of Bunched Implications -- Cut-Elimination: Experiments with CERES -- Uniform Rules and Dialogue Games for Fuzzy Logics -- Nonmonotonic Description Logic Programs: Implementation and Experiments -- Implementing Efficient Resource Management for Linear Logic Programming -- Layered Clausal Resolution in the Multi-modal Logic of Beliefs and Goals. |
|
|
|
|
|
| |