Filtern
Erscheinungsjahr
- 2007 (25) (entfernen)
Dokumenttyp
- Ausgabe (Heft) zu einer Zeitschrift (25) (entfernen)
Sprache
- Englisch (17)
- Deutsch (7)
- Mehrsprachig (1)
Schlagworte
- Augmented Reality (2)
- Bluetooth (2)
- Campus Information System (2)
- Enhanced Reality (2)
- Equality (2)
- Knowledge Compilation (2)
- Theorem Proving (2)
- University (2)
- 2D/3D-Segmentierung (1)
- 3D-Color-Structure-Code (1)
- 3D-RETISEG (1)
- Adaptive Services Grid (ASG) (1)
- Automated Theorem Proving (1)
- Automated Theorem Proving Systems (1)
- Bayes Procedures (1)
- Datenbrille (1)
- Datensicherheit (1)
- Delphi-Studie (1)
- E-KRHyper (1)
- Gesundheitswesen (1)
- Horn Clauses (1)
- Hyper Tableau Calculus (1)
- IASON (1)
- IT Security (1)
- IT-Risk-Management (1)
- Innovationsmanagement (1)
- Interaktionselemente (1)
- Internet Voting (1)
- Kalibrierung (1)
- Krankenhausinformationssystem (1)
- Kryptographie (1)
- MIA (1)
- MPEG-7 (1)
- Multi-robot System (1)
- Multiagent System (1)
- Ontology (1)
- Personalised Information Systems (1)
- Petri Nets (1)
- Petri-Netze (1)
- Probability (1)
- Propagation (1)
- RDF Graphs (1)
- Resource Description Framework (RDF) (1)
- Security (1)
- Semantics (1)
- Service-oriented Architectures (SOA) (1)
- Stochastic Logic (1)
- Tableau Calculus (1)
- Technologiemanagement (1)
- UML (1)
- Unified Modeling Language (UML ) (1)
- Web Ontology Language (OWL) (1)
- directed acyclic graphs (1)
- elektronische Anwendung (1)
- finite state automata (1)
- regular dag languages (1)
Hyper tableaux with equality
(2007)
In most theorem proving applications, a proper treatment of equational theories or equality is mandatory. In this paper we show how to integrate a modern treatment of equality in the hyper tableau calculus. It is based on splitting of positive clauses and an adapted version of the superposition inference rule, where equations used for paramodulation are drawn (only) from a set of positive unit clauses, the candidate model. The calculus also features a generic, semantically justified simplification rule which covers many redundancy elimination techniques known from superposition theorem proving. Our main results are soundness and completeness, but we briefly describe the implementation, too.