The Wobbly Logic Engine: Proving Hardness of Non-Rigid Geometric Graph Representation Problems

Lecture Notes in Computer Science - Germany
doi 10.1007/3-540-63938-1_69
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Geometric-Edge Random Graph Model for Image Representation

English

Using Representation Theorems for Proving Polynomials Non-Negative

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Proving Existential Termination of Normal Logic Programs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1996English

A Compositional Logic for Proving Security Properties of Protocols*

Journal of Computer Security
RiskComputer NetworksHardwareCommunicationsReliabilitySafetyArchitectureQualitySoftware
2003English

Geometric Representation of Recurring Sequences

Journal of the Australian Mathematical Society
Mathematics
1978English

Automated Theorem Proving by Translation to Description Logic

EasyChair Preprints
2018English

Tableau-Based Theorem Proving for Representation and Reasoning.

English

Practical Methods for Proving Termination of General Logic Programs

Journal of Artificial Intelligence Research
Artificial Intelligence
1996English

Proving Classical Theorems of Social Choice Theory in Modal Logic

Autonomous Agents and Multi-Agent Systems
Artificial Intelligence
2016English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy