Institut für Informatik und Computational Science
Refine
Year of publication
- 2011 (54) (remove)
Document Type
- Article (27)
- Doctoral Thesis (18)
- Monograph/Edited Volume (3)
- Other (2)
- Preprint (2)
- Habilitation Thesis (1)
- Moving Images (1)
Is part of the Bibliography
- yes (54)
Keywords
- Answer Set Programming (3)
- answer set programming (3)
- Antwortmengenprogrammierung (2)
- Tracking (2)
- Abstraktion (1)
- Accepting Grammars (1)
- Akzeptierende Grammatiken (1)
- Algorithmen (1)
- Algorithms (1)
- Answer set programming (1)
- Antwortmengen Programmierung (1)
- Asynchrone Schaltung (1)
- Automata systems (1)
- Beweistheorie (1)
- Bildverarbeitung (1)
- CP-Logic (1)
- CSC (1)
- CityGML (1)
- Code generation (1)
- Complex optimization (1)
- Computergrafik (1)
- Controlled Derivations (1)
- D-galactosamine (1)
- Decidability (1)
- Entwurfsmuster für SOA-Sicherheit (1)
- Entwurfsraumexploration (1)
- Extreme Model-Driven Development (1)
- FMC-QE (1)
- FPGA (1)
- Gesteuerte Ableitungen (1)
- Grammar Systems (1)
- Grammatiksysteme (1)
- Graphfärbung (1)
- Hardware-Software-Co-Design (1)
- Hierarchically configurable mask register (1)
- IT-Security (1)
- IT-Sicherheit (1)
- Incremental answer set programming (1)
- Inkonsistenz (1)
- Knowledge Representation and Reasoning (1)
- Knowledge representation (1)
- Komplexität (1)
- Komplexitätsbewältigung (1)
- L systems (1)
- Leftmost Derivations (1)
- Leistungsvorhersage (1)
- Linksableitungen (1)
- Localization (1)
- Logiksynthese (1)
- Markov processes (1)
- Masking of X-values (1)
- Meta-Programming (1)
- Model Driven Architecture (1)
- Model checking (1)
- Modell (1)
- Modell-driven Security (1)
- Modell-getriebene Sicherheit (1)
- Modellgetriebene Architektur (1)
- Nutzungsinteresse (1)
- Ontologie (1)
- Ontology (1)
- Operation problem (1)
- Parsing (1)
- Performance Prediction (1)
- Pre-RS Traceability (1)
- Preference Handling (1)
- Problemlösen (1)
- Process model analysis (1)
- Proof Theory (1)
- Prozess (1)
- Quantitative Modeling (1)
- Quantitative Modellierung (1)
- Queuing Theory (1)
- Reparatur (1)
- SOA Security Pattern (1)
- STG decomposition (1)
- STG-Dekomposition (1)
- Security Modelling (1)
- Semantic Web (1)
- Service-Orientierte Architekturen (1)
- Service-oriented Architectures (1)
- Sicherheitsmodellierung (1)
- Statistical relational learning (1)
- Stochastic relational process (1)
- System Biologie (1)
- Texturen (1)
- Theoretische Informatik (1)
- Time Augmented Petri Nets (1)
- Time series (1)
- Transformation (1)
- Unary languages (1)
- Unvollständigkeit (1)
- Usage Interest (1)
- Verification (1)
- Warteschlangentheorie (1)
- Web Sites (1)
- Webseite (1)
- Wireless Sensor Networks (1)
- Wissensrepräsentation und -verarbeitung (1)
- Zeitbehaftete Petri Netze (1)
- abstraction (1)
- acute liver failure (1)
- asynchronous circuit (1)
- behavioral abstraction (1)
- bioinformatics (1)
- block representation (1)
- cellular automata (1)
- complexity (1)
- computer graphics (1)
- consistency (1)
- consistency checking (1)
- consistency measures (1)
- cooperating systems (1)
- decidability questions (1)
- declarative problem solving (1)
- design space exploration (1)
- diagnosis (1)
- endothelin (1)
- endothelin-converting enzyme (1)
- finite model computation (1)
- formal languages (1)
- hardware-software-codesign (1)
- image processing (1)
- incompleteness (1)
- inconsistency (1)
- kidney cancer (1)
- logic synthesis (1)
- loop formulas (1)
- metabolism (1)
- metabolomics (1)
- metastasis (1)
- model (1)
- neighborhood (1)
- neutral endopeptidase (1)
- nichtlineare Projektionen (1)
- nonlinear projections (1)
- on-chip (1)
- process (1)
- process model alignment (1)
- quantum (1)
- repair (1)
- semantisches Netz (1)
- speed independence (1)
- stable model semantics (1)
- systems biology (1)
- textures (1)
- transformation (1)
- unfounded sets (1)
- virtual 3D city models (1)
- virtuelle 3D-Stadtmodelle (1)
We address the problem of Finite Model Computation (FMC) of first-order theories and show that FMC can efficiently and transparently be solved by taking advantage of a recent extension of Answer Set Programming (ASP), called incremental Answer Set Programming (iASP). The idea is to use the incremental parameter in iASP programs to account for the domain size of a model. The FMC problem is then successively addressed for increasing domain sizes until an answer set, representing a finite model of the original first-order theory, is found. We implemented a system based on the iASP solver iClingo and demonstrate its competitiveness by showing that it slightly outperforms the winner of the FNT division of CADE's 2009 Automated Theorem Proving (ATP) competition on the respective benchmark collection.